Multi-dimensional clustering for data base organizations

DOI10.1016/0306-4379(77)90007-2zbMath0362.68024OpenAlexW2027507804MaRDI QIDQ1240051

K. Appert

Publication date: 1977

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1152&context=cstech

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (7)

Optimal multiple key hashing files for orthogonal range queries ⋮ 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 ⋮ Disk allocation methods for binary Cartesian product files

This page was built for publication: Multi-dimensional clustering for data base organizations