Adaptive File Allocation in Star Computer Network
IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Approximating block accesses in database organizations
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient processing of relational calculus expressions using range query theory
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Dynamic information and library processing
Dynamic information and library processing
Algorithms to Process Distributed Queries in Fast Local Networks
IEEE Transactions on Computers
Fast object partitioning using Stochastic learning automata
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A framework for effective retrieval
ACM Transactions on Database Systems (TODS)
Improvements to an Algorithm for Equipartitioning
IEEE Transactions on Computers
A parallel algorithm for record clustering
ACM Transactions on Database Systems (TODS)
On the performance of object clustering techniques
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Towards an efficient management of objects in a distributed environment
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Using a cluster manager in a spatial database system
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Logically Clustered Architectures for Networked Databases
Distributed and Parallel Databases
A New Approach to Clustering Records in Information Retrieval Systems
Information Retrieval
Index configuration in object-oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
Automatic Knowledge Acquisition and Maintenance for Semantic Query Optimization
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of a Concurrent File Reorganization Algorithm for Record Clustering
IEEE Transactions on Knowledge and Data Engineering
Adaptive Prefetching and Storage Reorganization In A Log-Structured Storage System
IEEE Transactions on Knowledge and Data Engineering
Vector-based approach to analysis of file space properties
Progress in computer research
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Connectionist interaction information retrieval
Information Processing and Management: an International Journal - Modelling vagueness and subjectivity in information access
Research issues in automatic database clustering
ACM SIGMOD Record
Incremental file reorganization schemes
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
| Hi-index | 0.01 |
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.