Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method
- 1 May 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-7 (3), 284-290
- https://doi.org/10.1109/tse.1981.230839
Abstract
The problem of performing multiple attribute clustering in a dynamic database is studied. The extended K-d tree method is presented. In an extended K-d tree organization, the basic k-d tree structure after modification is used as the structure of the directory which organizes the data records in the secondary storage. The discriminator value of each level of the directory determines the partitioning direction of the corresponding attribute subspace. When the record insertion causes the data page to overload, the attribute space will be further partitioned along the direction specified by the corresponding discriminator.Keywords
This publication has 4 references indexed in Scilit:
- Multi-dimensional clustering for data base organizationsInformation Systems, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- Organization and maintenance of large ordered indexesActa Informatica, 1972