Filtering search: a new approach to query answering
SIAM Journal on Computing
SCG '87 Proceedings of the third annual symposium on Computational geometry
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
Bucketing, also known as fixed cells, is a data structure that is especially suitable for queries that cover small windows. However, this technique is not efficient if objects are long and narrow, such as wires. Also, as more objects are added, the efficiency of the query process may suffer. The authors describe a dynamic bucketing structure that maintains a two-level director structure and uses a directory doubting and merging technique called extendible hashing. This technique allows directories to expand without sacrificing performance as more objects are inserted into the structure. They report the results of tests comparing the performance of dynamic bucketing with the performance of the quad-tree algorithms.