Disk allocation for Cartesian product files on multiple-disk systems

DOI10.1145/319682.319698zbMath0485.68087OpenAlexW2041989747MaRDI 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 managementfile organizationfile allocation problempartial match queriesdisk modulo allocation methodrandom allocation methods

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (12)

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

This page was built for publication: Disk allocation for Cartesian product files on multiple-disk systems