This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method
May 1981 (vol. 7 no. 3)
pp. 284-290
null Jo-Mei Chang, Bell Laboratories
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.
Index Terms:
physical database design, Dynamic clustering method, multiattribute, partial match query
Citation:
null Jo-Mei Chang, null King-Sun Fu, "Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method," IEEE Transactions on Software Engineering, vol. 7, no. 3, pp. 284-290, May 1981, doi:10.1109/TSE.1981.230839
Usage of this product signifies your acceptance of the Terms of Use.