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

[1]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[2]  Michael Hammer,et al.  A heuristic approach to attribute partitioning , 1979, SIGMOD '79.

[3]  Jo-Mei Chang,et al.  Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method , 1981, IEEE Transactions on Software Engineering.

[4]  森 雅夫,et al.  Self-Organizing Sequential Searchについて , 1980 .

[5]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[6]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[7]  Peter Scheuermann,et al.  A Global Approach to Record Clustering and File Reorganization , 1984, SIGIR.

[8]  Kapali P. Eswaran.  Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[9]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[10]  Matti Jakobsson,et al.  Reducing block accesses in inverted files by partial clustering , 1980, Inf. Syst..

[11]  Arvola Chan,et al.  Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.

[12]  Jacques Kouloumdjian,et al.  Data Base Reorganization by Clustering Methods , 1978, Inf. Syst..

[13]  Clement T. Yu,et al.  File Allocation in Distributed Databases with Interaction between Files , 1983, VLDB.

[14]  Sakti P. Ghosh.  Data base organization for data management , 1977 .

[15]  Sakti P. Ghosh.  Data base organization for data management (2nd ed.) , 1986 .

[16]  Dan E. Willard,et al.  Efficient processing of relational calculus expressions using range query theory , 1984, SIGMOD '84.

[17]  Clement T. Yu.  Adaptive document clustering , 1985, SIGIR '85.

[18]  H. Scheffé.  The Analysis of Variance , 1960 .

[19]  Clement T. Yu,et al.  Adaptive File Allocation in Star Computer Network , 1985, IEEE Transactions on Software Engineering.

[20]  Gerard Salton,et al.  Dynamic information and library processing , 1975 .