Binary search networks: A new method for key searching (Q1091827)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4011952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary search networks: A new method for key searching |
scientific article; zbMATH DE number 4011952 |
Statements
Binary search networks: A new method for key searching (English)
0 references
1987
0 references
A novel method for key searching, binary search networks, is proposed, and its search, insertion, and deletion algorithms are presented. A binary search network is an extension of a binary search tree which is widely used as a practical key search method. Some properties of binary search networks are discussed, and the optimization problem of minimizing a search cost is remarked upon. The advantages and disadvantages of binary search networks relative to binary search trees are also discussed.
0 references
two-dimensional mesh structures
0 references
VLSI architecture
0 references
optimization
0 references
key searching
0 references
binary search networks
0 references
0 references
0 references
0.8122829
0 references
0.80672014
0 references
0.8046089
0 references
