Disk allocation for Cartesian product files on multiple-disk systems

DOI10.1145/319682.319698zbMath0485.68087MaRDI QIDQ3945620

H. C. Du, John S. Sobolewski

Publication date: 1982

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319682.319698

zbMATH Keywords

database management; file organization; file allocation problem; partial match queries; disk modulo allocation method; random allocation methods

Mathematics Subject Classification ID

68P10: Searching and sorting

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

Multidisk file design: An analysis of folding buckets to disks, Threshold-based declustering, Disk allocation methods for binary Cartesian product files, Application of principal component analysis to multi-disk concurrent accessing, Optimal multidisk partial match file designs, The FX distribution method for parallel processing of partial match queries, Optimality criteria of the disk modulo allocation method for Cartesian product files, Multidisk partial match file design with known access pattern, Asymptotically optimal declustering schemes for 2-dim range queries., Latin squares and low discrepancy allocation of two-dimensional data, Improved bounds and schemes for the declustering problem, A note on allocating k-ary multiple key hashing files among multiple disks