Attribute based file organization in a paged memory environment
Communications of the ACM
Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Parallel searching for binary Cartesian product files
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval
IEEE Transactions on Knowledge and Data Engineering
A global approach to record clustering and file reorganization
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
A Mapping Function for the Directory of a Multidimensional Extendible Hashing
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Orthogonal range retrieval using bucket address hashing
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
| Hi-index | 0.00 |
In this paper, we first introduced the concept of Cartesian product files. We then derived a formula for random files. A computer simulation experiment was performed to compare these two files. So far as shown by the experimental results, the Cartesian product file concept was indeed a good one. We also showed that the problem of designing an optimal Cartesian product file was partially related to the problem of finding a minimal N-tuple. A method to find minimal N-tuples was presented and its properties were discussed.