Adaptive record clustering

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 collecti...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on database systems 1985-06, Vol.10 (2), p.180-204
Main Authors: Yu, C. T., Suen, Cheing-mei, Lam, K., Siu, M. K.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Contextual software domains
Data access methods
Data management systems
Data structures
Data structures design and analysis
Design and analysis of algorithms
Discrete mathematics
Exact sciences and technology
File systems management
Information storage systems
Information systems
Mathematics of computing
Memory and file management (including protection and security)
Memory organisation. Data processing
Operating systems
Record storage systems
Software
Software and its engineering
Software organization and properties
Sorting and searching
Theory of computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0362-5915
1557-4644
DOI:10.1145/3857.3861