Adaptive information system design: one query at a time

We propose a new way to perform adaptive i nf ormat 1 on system design An abstract lnformatlon structure provides lnformatlon about how dn appropr 1 ate actual lnformatlon structure should be Whenever a query 1s processed, the abstract information structure is modified to reflect the effect of the processed query After many queries are processed, the abstract structure 1s examined If It reveals that the actual information structure is InapproprIate, then the actual structure Will be modified, otherwise no change 1s made This one-query-at-a-time approach 1s applied to two problems, namely the record clustering problem and the file allocation to distributed database problem Results demonstrate that our approach yields good performance, 1s concePtuallY very simple, is lntultlvely natural and has a reasonable running time Reasons for using our appr oath versus previous methods are also sketched

[1]  Clement T. Yu,et al.  A clustered search algorithm incorporating arbitrary term dependencies , 1982, TODS.

[2]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[3]  K. T. Fung.  A. Reorganization Model Based on the Database Entropy Concept , 1984, Comput. J..

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

[5]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[6]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[7]  W. Bruce Croft.  Clustering large files of documents using the single-link method , 1977, J. Am. Soc. Inf. Sci..

[8]  S. Bing Yao,et al.  Multi-dimensional clustering for data base organizations , 1977, Inf. Syst..

[9]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[10]  Ben Shneiderman.  Optimum data base reorganization points , 1973, CACM.

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

[12]  Alan R. Hevner,et al.  Query Processing in Distributed Database System , 1979, IEEE Transactions on Software Engineering.

[13]  本田 公男.  Query Processing in Distributed Database Systems , 1980 .

[14]  Toby J. Teorey,et al.  A dynamic database reorganization algorithm , 1976, TODS.

[15]  Don S. Batory.  Optimal file designs and reorganization points , 1982, TODS.

[16]  Stavros Christodoulakis,et al.  Estimating block transfers and join sizes , 1983, SIGMOD '83.

[17]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[18]  Mario Schkolnick,et al.  A clustering algorithm for hierarchical structures , 1977, TODS.

[19]  C. J. van Rijsbergen,et al.  Further experiments with hierarchic clustering in document retrieval , 1974, Inf. Storage Retr..

[20]  Dennis G. Severance,et al.  The determination of efficient record segmentations and blocking factors for shared data files , 1977, TODS.

[21]  William G. Tuel.  Optimum reorganization points for linearly growing files , 1978, TODS.

[22]  Geneva G. Belford,et al.  Some theorems to aid in solving the file allocation problem , 1977, CACM.

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

[24]  Clement T. Yu,et al.  Adaptive record clustering , 1985, TODS.

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

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

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

[28]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[29]  Chai-Hsiung Chen.  An adaptive technique and its application in database design , 1984 .

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