Data base design with the constrained multiple attribute tree (Q1058874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3902088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data base design with the constrained multiple attribute tree |
scientific article; zbMATH DE number 3902088 |
Statements
Data base design with the constrained multiple attribute tree (English)
0 references
1985
0 references
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.
0 references
directory type access
0 references
0.7772142291069031
0 references
0.7509524822235107
0 references
0.7414058446884155
0 references
0.7399514317512512
0 references
