Data base design with the constrained multiple attribute tree

摘要

A Multiple Attribute Tree [10] 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.