Disk allocation methods for binary Cartesian product files
From MaRDI portal
Recommendations
- Optimality criteria of the disk modulo allocation method for Cartesian product files
- Multidisk partial match file design with known access pattern
- Optimal multidisk partial match file designs
- Multidisk file design: An analysis of folding buckets to disks
- A note on allocating k-ary multiple key hashing files among multiple disks
Cites work
- Canonical structure in attribute based file organization
- Disk allocation for Cartesian product files on multiple-disk systems
- Multi-dimensional clustering for data base organizations
- Multidisk file design: An analysis of folding buckets to disks
- Optimality Properties of Multiple-Key Hashing Functions
- Partial-Match Retrieval Algorithms
Cited in
(9)- A note on allocating k-ary multiple key hashing files among multiple disks
- On GDM allocation method for partial range queries
- Algorithms for multidimensional partitioning of static files
- Application of principal component analysis to multi-disk concurrent accessing
- Optimal multidisk partial match file designs
- Short notes: A Recursive Performance Formula of the Disc Modulo Allocation Method for Binary Cartesian Product Files
- Optimality criteria of the disk modulo allocation method for Cartesian product files
- Multidisk file design: An analysis of folding buckets to disks
- Multidisk partial match file design with known access pattern
This page was built for publication: Disk allocation methods for binary Cartesian product files
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075064)
