ACM Transactions on Database Systems (TODS)
Balanced multidimensional extendible hash tree
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Multidimensional order preserving linear hashing with partial expansions
Proceedings on International conference on database theory
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
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)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Twin Grid File: A Nearly Space Optimal Index Structure
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Spatial Searching in Geometric Databases
Proceedings of the Fourth International Conference on Data Engineering
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Multidimensional access methods
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Query Processing for Multi-Attribute Clustered Records
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The PN-tree: a parallel and distributed multidimensional index
Distributed and Parallel Databases
| Hi-index | 0.00 |
Storage access schemes for points, supporting spatial searching, usually suffer from an undesirably low storage space utilization. We show how a given set of points can be distributed among two grid files in such a way that storage space utilization is optimal. The optimal twin grid file can be built practically as fast as a standard grid file, i.e., the storage space optimality is obtained at almost no extra cost. We compare the performances of the standard grid file, the optimal static twin grid file, and an efficient dynamic twin grid file, where insertions and deletions trigger the redistribution of points among the two grid files. Twin grid files utilize storage space at roughly 90%, as compared with the 69% of the standard grid file. Typical range queries - the most important spatial search operations - can be answered in twin grid files at least as fast as in the standard grid file.