Data base design with the constrained multiple attribute tree

DOI10.1016/0306-4379(85)90008-0MaRDI QIDQ1058874zbMATH OpenOpenAlexFDO

Authors E. Bretholz, Doron Rotem

Publication date 1985

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0306-4379(85)90008-0

zbMATH Keywords

directory type access

Mathematics Subject Classification ID

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

Review text

A multiple attribute tree is a directory type access mechanism to retrieve data base records that are indexed by several attributes. Here we deal with the construction of an optimal MAT where the number of buckets available for accommodating the data base is constrained. This data structure is called a Constrained Multiple Attribute Tree (CMAT). We present an algorithm for constructing an optimal CMAT from a given MAT for data bases in which the values assigned to attributes of a record are independent.

Recommendations

• Optimal attribute ranking in multiple attribute tree
• scientific article; zbMATH DE number 19204
• Optimal information retrieval when queries are not random
• Secondary attribute retrieval using tree data structures
• An average-case analysis of MAT and inverted file

Cited in

(3)

• Optimal attribute ranking in multiple attribute tree
• scientific article; zbMATH DE number 19204 (Why is no real title available?)
• Secondary attribute retrieval using tree data structures

This page was built for publication: Data base design with the constrained multiple attribute tree

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