Quintary trees: a file structure for multidimensional datbase sytems
ACM Transactions on Database Systems (TODS)
Introduction to VLSI Systems
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Computer
A rapid turnaround design of a high speed VLSI search processor
Integration, the VLSI Journal
| Hi-index | 0.01 |
A simple and general VLSI-architecture, designed to solve a family of basic searching problems, is presented. The actual chip (the H-matrix) may generally be set up to trap requested objects or to detect specific properties in high-rate bit-serial datastreams flowing through the chip. The most important problem for which the design is applicable corresponds to the database operation known as General Range Queries which includes standard String Pattern Matching. The problem of reporting intersecting pairs in large sets of rectilinear rectangles, a crucial step in checking the design rules for VLSI circuitry, is also a member in the family of problems that can be handled. Other possible applications of the design, such as real-time collection of statistics and distribution sorting, are discussed. A hierarchical implementation of the critical cells, described by familiar high-level language notations, is presented. The actual design has been successfully implemented in NMOS.