Optimal multidisk partial match file designs

DOI10.1016/0020-0190(88)90161-5MaRDI QIDQ1111781zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90161-5

zbMATH Keywords

redundancypartial match queriesmultidisk file design

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• Disk allocation for Cartesian product files on multiple-disk systems
• Partial-Match Retrieval Algorithms

Cited in

(10)

• A note on allocating k-ary multiple key hashing files among multiple disks
• On GDM allocation method for partial range queries
• Optimality Properties of the Disc Modulo Allocation Method for k-ary Multiple Key Hashing Files
• On the complexity of designing optimal partial-match retrieval systems
• On the File Design Problem for Partial Match Retrieval
• Optimal multi-file read policies for optical discs
• On optimization approach for multidisk vertical allocation problems
• Multidisk file design: An analysis of folding buckets to disks
• Multidisk partial match file design with known access pattern
• Disk allocation methods for binary Cartesian product files

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)