Some properties of Cartesian product files

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.

[1]  S. Bing Yao,et al.  Multi-dimensional clustering for data base organizations , 1977, Inf. Syst..

[2]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[3]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[4]  Richard C. T. Lee,et al.  Common Properties of Some Multiattribute File Systems , 1979, IEEE Transactions on Software Engineering.

[5]  Richard C. T. Lee,et al.  Experiments with some cluster analysis algorithms , 1974, Pattern Recognit..