ACM Computing Surveys (CSUR)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
FLASH: a language-independent, portable file access system
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A VLSI tree machine for relational data bases
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Hardware sorter and its application to data base machine
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Dictionary machines with a small number of processors
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
An Efficient Implementation of Search Trees on O(log N) Processors
An Efficient Implementation of Search Trees on O(log N) Processors
On a high-performance vlsi solution to database problems
On a high-performance vlsi solution to database problems
A Generalized Dictionary Machine for VLSI
IEEE Transactions on Computers
A Dictionary Machine (for VLSI)
IEEE Transactions on Computers
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Tree structures for partial match retrieval
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Large-Capacity High-Throughput Low-Cost Pipelined CAM Using Pipelined CTAM
IEEE Transactions on Computers
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 14.98 |
A scheme for maintaining a balanced search tree on ?lg N + 1?parallel processors is described. The scheme is almost fully pipelined: ?lg N + 1?/2 search, insert, and delete operations may run concurrently. Each processor executes 0(1) instructions of a top-down 2-3-4 tree manipulation algorithm before passing the operation along to the next processor in the pipeline. Thus, the total delay per tree operation is O(lg N), and one tree operation completes every 0(1) time units.