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

multidisk file designpartial match queriesredundancy

Mathematics Subject Classification ID

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

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

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

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)