Performance Analyses of Cartesian Product Files and Random Files

DOI10.1109/TSE.1984.5010203MaRDI QIDQ3036741zbMATH OpenOpenAlexFDO

Authors Chin-Chen Chang, M. W. Du

Publication date 1984

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1984.5010203

zbMATH Keywords

partial match queriesCartesian product filespartition filesrandom files

Mathematics Subject Classification ID

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

Cited in

(5)

• Optimal information retrieval when queries are not random
• The hierarchical ordering in multiattribute files
• Some properties of optimal cartesian product files for orthogonal range queries
• Optimality criteria of the disk modulo allocation method for Cartesian product files
• A note on allocating k-ary multiple key hashing files among multiple disks

This page was built for publication: Performance Analyses of Cartesian Product Files and Random Files

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