Multidisk file design: An analysis of folding buckets to disks

DOI10.1007/BF02136024zbMATH Open0545.68087OpenAlexW1965709939MaRDI QIDQ797303FDOQ797303

Authors: Mee Yee Chan 

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02136024

Recommendations

• Optimal multidisk partial match file designs
• Multidisk partial match file design with known access pattern
• Disk allocation methods for binary Cartesian product files
• A note on allocating k-ary multiple key hashing files among multiple disks
• Performance analysis of file organizations that use multi-bucket data leaves

zbMATH Keywords

foldingpartial match querypartial match retrievalDisk Modulo allocationfile bucketsmultiple disks

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Disk allocation for Cartesian product files on multiple-disk systems

Cited In (10)

• A note on allocating k-ary multiple key hashing files among multiple disks
• Application of principal component analysis to multi-disk concurrent accessing
• Optimal multidisk partial match file designs
• On optimization approach for multidisk vertical allocation problems
• Embedded minimal disks: Proper versus nonproper—global versus local
• Optimality criteria of the disk modulo allocation method for Cartesian product files
• Performance analysis of file organizations that use multi-bucket data leaves
• Multidisk partial match file design with known access pattern
• Disk allocation methods for binary Cartesian product files
• Active File Systems for Data Mining and Multimedia

This page was built for publication: Multidisk file design: An analysis of folding buckets to disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797303)