Optimization of join operations in horizontally partitioned database systems
ACM Transactions on Database Systems (TODS)
Database machines and database management
Database machines and database management
Relational Information Systems
Relational Information Systems
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
A multikey hashing scheme using predicate trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Algorithms for loading parallel grid files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An access structure for similarity-based fuzzy databases
Information Sciences: an International Journal
| Hi-index | 0.00 |
The problem of multidimensional file partitioning (MDFP) arises in large databases that are subject to frequent range queries on one or more attributes. In an MDFP scheme, the search attribute space is partitioned into cells, which are mapped to physical disk locations. This mapping preserves the order of the search attribute values so that range queries can be answered most efficiently, while maintaining good performance for other types of queries. Recently, MDFP schemes have been suggested to include both dynamic and static file organizations. Optimal and heuristic MDFP algorithms are developed for the static case. The results of extensive computational experiments show that the proposed heuristics perform better than known static ones. It is also shown that incorporating a static algorithm into a dynamic MDFP such as a grid file at conversion and/or periodical reorganization points significantly improves the resulting storage utilization of the data file and decreases the size of the directory file.