Binary search networks: A new method for key searching (Q1091827): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90199-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016420340 / rank | |||
Normal rank | |||
Revision as of 23:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary search networks: A new method for key searching |
scientific article |
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
