Optimal multidisk partial match file designs
From MaRDI portal
(Redirected from Publication:1111781)
Addressed here is the problem of assigning buckets of a file to multiple independently accessible disks so that all partial match queries are answered with as much parallelism exploited as possible. We consider how much redundancy is necessary and sufficient to have these so-called optimal assignments.
Recommendations
- Multidisk partial match file design with known access pattern
- On the File Design Problem for Partial Match Retrieval
- Multidisk file design: An analysis of folding buckets to disks
- Disk allocation methods for binary Cartesian product files
- A note on allocating k-ary multiple key hashing files among multiple disks
Cites work
Cited in
(11)- Disk allocation methods for binary Cartesian product files
- Optimality criteria of the disk modulo allocation method for Cartesian product files
- Multidisk partial match file design with known access pattern
- On optimization approach for multidisk vertical allocation problems
- Optimal multi-file read policies for optical discs
- A note on allocating k-ary multiple key hashing files among multiple disks
- On the complexity of designing optimal partial-match retrieval systems
- On the File Design Problem for Partial Match Retrieval
- Optimality Properties of the Disc Modulo Allocation Method for k-ary Multiple Key Hashing Files
- On GDM allocation method for partial range queries
- Multidisk file design: An analysis of folding buckets to disks
This page was built for publication: Optimal multidisk partial match file designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111781)
