Multi-dimensional clustering for data base organizations

DOI10.1016/0306-4379(77)90007-2MaRDI QIDQ1240051zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(7)

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

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

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