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)
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
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
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Declustering using error correcting codes
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disk Allocation Methods Using Error Correcting Codes
IEEE Transactions on Computers
Frame-sliced partitioned parallel signature files
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
On the optimality of disk allocation for Cartesian product files (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
| Hi-index | 0.01 |
The problem of distributing buckets in a file among m disks to facilitate parallel searching for a set of queries is analysed in this paper. We are particularly concerned with the file distribution problem for binary Cartesian product files, and partial match queries. A method is proposed and shown to be strict optimal under certain conditions. The performance of the proposed method is compared with those of an “ideal” strict optimal and Du's heuristic allocation method.