Optimality criteria of the disk modulo allocation method for Cartesian product files
From MaRDI portal
Publication:1182608
DOI10.1007/BF01933172zbMath0736.68026MaRDI QIDQ1182608
Publication date: 28 June 1992
Published in: BIT (Search for Journal in Brave)
partial match query; strictly optimal allocation method; Cartesian product files; disk modulo allocation method
68P20: Information storage and retrieval of data
Cites Work
- Multidisk file design: An analysis of folding buckets to disks
- Disk allocation methods for binary Cartesian product files
- Application of principal component analysis to multi-disk concurrent accessing
- Multi-dimensional clustering for data base organizations
- A note on allocating k-ary multiple key hashing files among multiple disks
- Performance Analyses of Cartesian Product Files and Random Files
- Short notes: A Recursive Performance Formula of the Disc Modulo Allocation Method for Binary Cartesian Product Files
- Disk allocation for Cartesian product files on multiple-disk systems
- Partial-Match Retrieval Algorithms
- An Information Protection Scheme Based upon Number Theory