Optimal information retrieval when queries are not random
Information Sciences: an International Journal
On the complexity of some multi-attribute file design problems
Information Systems
Performance Analysis of Disk Modulo Allocation Method for Cartesian Product Files
IEEE Transactions on Software Engineering
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Disk Allocation Methods Using Error Correcting Codes
IEEE Transactions on Computers
Symbolic Gray code as a data allocation scheme for two-disc systems
The Computer Journal - Special issue on information retrieval
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
Redundant MKH files design among multiple disks for concurrent partial match retrieval
Journal of Systems and Software
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Partial-match hash coding: benefits of redundancy
ACM Transactions on Database Systems (TODS)
Optimality Properties of Multiple-Key Hashing Functions
Journal of the ACM (JACM)
Attribute based file organization in a paged memory environment
Communications of the ACM
Some properties of Cartesian product files
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Stochastic Programming Approach for Range Query Retrieval Problems
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
This paper first shows that the bucket allocation problem of an MKH (Multiple Key Hashing) file for partial match retrieval can be reduced to that of a smaller sized subfile, called the remainder of the file. And it is pointed out that the remainder type MKH file is the hardest MKH file for which to design an optimal allocation scheme. We then particularly concentrate on the allocation of an important remainder type MKH file; namely, the k-ary MKH file. We present various sufficient conditions on the number of available disks and the number of attributes for a k-ary MKH file to have a perfectly optimal allocation among the disks for partial match queries. Based upon these perfectly optimal allocations, we further present a heuristic method, called the CH (Cyclic Hashing) method, to produce near optimal allocations for the general k-ary MKH files. Finally, a comparison, by experiment, between the performances of the proposed method and an "ideal" perfectly optimal method, shows that the CH method is indeed satisfactorily good for the general k-ary MKH files.