Performance Analyses of Cartesian Product Files and Random Files

DOI10.1109/TSE.1984.5010203zbMath0524.68058OpenAlexW2050412202MaRDI QIDQ3036741

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

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

Related Items (5)

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

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