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
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Principles of distributed database systems
Principles of distributed database systems
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributed operating systems
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
LH*LH: A scalable High Performance Data Structure for Switched Multicomputers
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Linearizing the Directory Growth in Order Preserving Extendible Hashing
Proceedings of the Fourth International Conference on Data Engineering
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
PLOP-Hashing: A Grid File without Directory
Proceedings of the Fourth International Conference on Data Engineering
A Robust Multi-Attribute Search Structure
Proceedings of the Fifth International Conference on Data Engineering
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Balanced Distributed Search Trees Do Not Exist
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Robust distributed indexing for locality-skewed workloads
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Spatial data storage stresses the capability of conventional DBMSs. We present a scalable distributed data structure, hQT*, which offers support for efficient spatial point and range queries using order preserving hashing. It is designed to deal with skewed data and extends results obtained with scalable distributed has files, LH*, and other hashing schemas. Performance analysis shows that an hQT* file is a viable schema for distributed data access, and in contrast to traditional quad-trees it avoids long traversals of hierarchical structures. Furthermore, the novel data structure is a complete design addressing both scalable data storage and local server storage management as well as managementclients addressing. We investigate several different client updating schemes, enabling better access load distribution for may "slow" clients.