Adaptive record clustering
- 1 June 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 10 (2) , 180-204
- https://doi.org/10.1145/3857.3861
Abstract
An algorithm for record clustering is presented. It is capable of detecting sudden changes in users' access patterns and then suggesting an appropriate assignment of records to blocks. It is conceptually simple, highly intuitive, does not need to classify queries into types, and avoids collecting individual query statistics. Experimental results indicate that it converges rapidly; its performance is about 50 percent better than that of the total sort method, and about 100 percent better than that of randomly assigning records to blocks.Keywords
This publication has 12 references indexed in Scilit:
- Adaptive document clusteringPublished by Association for Computing Machinery (ACM) ,1985
- Efficient processing of relational calculus expressions using range query theoryACM SIGMOD Record, 1984
- Efficient processing of relational calculus expressions using range query theoryPublished by Association for Computing Machinery (ACM) ,1984
- Implementation techniques for main memory database systemsPublished by Association for Computing Machinery (ACM) ,1984
- Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering MethodIEEE Transactions on Software Engineering, 1981
- Reducing block accesses in inverted files by partial clusteringInformation Systems, 1980
- Data base reorganization by clustering methodInformation Systems, 1978
- Approximating block accesses in database organizationsCommunications of the ACM, 1977
- On self-organizing sequential search heuristicsCommunications of the ACM, 1976
- Index selection in a self-adaptive data base management systemPublished by Association for Computing Machinery (ACM) ,1976