Disk allocation methods for binary Cartesian product files

DOI10.1007/BF01933739zbMath0591.68092OpenAlexW1991837073MaRDI QIDQ1075064

H. C. Du

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933739

zbMATH Keywords

file structurespartial match querypartial match retrievalmulti-key hashingdisk access time

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (3)

A note on allocating k-ary multiple key hashing files among multiple disks ⋮ Application of principal component analysis to multi-disk concurrent accessing ⋮ Optimality criteria of the disk modulo allocation method for Cartesian product files

Cites Work

• Multidisk file design: An analysis of folding buckets to disks
• Multi-dimensional clustering for data base organizations
• Disk allocation for Cartesian product files on multiple-disk systems
• Partial-Match Retrieval Algorithms
• Optimality Properties of Multiple-Key Hashing Functions
• Canonical structure in attribute based file organization

This page was built for publication: Disk allocation methods for binary Cartesian product files