ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Adaptive Information System Design: One Query at a Time.

Clement T. Yu, C. H. Chen: Adaptive Information System Design: One Query at a Time. SIGMOD Conference 1985: 280-290
@inproceedings{DBLP:conf/sigmod/YuC85,
  author    = {Clement T. Yu and
               C. H. Chen},
  editor    = {Shamkant B. Navathe},
  title     = {Adaptive Information System Design: One Query at a Time},
  booktitle = {Proceedings of the 1985 ACM SIGMOD International Conference on
               Management of Data, Austin, Texas, May 28-31, 1985},
  publisher = {ACM Press},
  year      = {1985},
  pages     = {280-290},
  ee        = {http://doi.acm.org/10.1145/318898.318924, db/conf/sigmod/YuC85.html},
  crossref  = {DBLP:conf/sigmod/85},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

We propose a new way to perform adaptive information system design. An abstract information structure provides information about how an appropriate actual information structure should be. Whenever a query is processed, the abstract information structure is modified to reflect the effect of the processed query. After many queries are processed, the abstract structure is examined. If it reveals that the actual information structure is inappropriate, then the actual structure will be modified, otherwise no change is made.

This one-query-at-a-time approach is 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, is conceptuallY very simple, is intuitively natural and has a reasonable running time. Reasons for using our approach versus previous methods are also sketched.

Copyright © 1985 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Shamkant B. Navathe (Ed.): Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 28-31, 1985. ACM Press 1985 BibTeX , SIGMOD Record 14(4)
Contents

Online Edition: ACM Digital Library


References

[Aper]
Peter M. G. Apers: Redundant Allocation of Relations in a Communication Network. Berkeley Workshop 1981: 245-258 BibTeX
[Aper1]
Peter M. G. Apers: Data Allocation in Distributed Database Systems. ACM Trans. Database Syst. 13(3): 263-304(1988) BibTeX
[Bato]
Don S. Batory: Optimal File Designs and Reorganization Points. ACM Trans. Database Syst. 7(1): 60-81(1982) BibTeX
[Case]
...
[Chan]
...
[ChLi]
...
[Chen]
...
[Chri]
Stavros Christodoulakis: Estimating Block Transfers and Join Sizes. SIGMOD Conference 1983: 40-54 BibTeX
[Cook]
Stephen A. Cook: The Complexity of Theorem-Proving Procedures. STOC 1971: 151-158 BibTeX
[Crof]
...
[DoFo]
Lawrence W. Dowdy, Derrell V. Foster: Comparative Models of the File Assignment Problem. ACM Comput. Surv. 14(2): 287-313(1982) BibTeX
[Eswa]
Kapali P. Eswaran: Placement of Records in a File and File Allocation in a Computer. IFIP Congress 1974: 304-307 BibTeX
[FiHo]
Marshall L. Fisher, Dorit S. Hochbaum: Database Location in Computer Networks. J. ACM 27(4): 718-735(1980) BibTeX
[FUNG]
K. T. Fung: A. Reorganization Model Based on the Database Entropy Concept. Comput. J. 27(1): 67-71(1984) BibTeX
[Ghos]
...
[GrBe]
Enrique Grapa, Geneva G. Belford: Some Theorems to Aid in Solving the File Allocation Problem. Commun. ACM 20(11): 878-882(1977) BibTeX
[HaNi]
Michael Hammer, Bahram Niamir: A Heuristic Approach to Attribute Partitioning. SIGMOD Conference 1979: 93-101 BibTeX
[HaCh]
Michael Hammer, Arvola Chan: Index Selection in a Self-Adaptive Data Base Management System. SIGMOD Conference 1976: 1-8 BibTeX
[HaYa]
Alan R. Hevner, S. Bing Yao: Query Processing in Distributed Database Systems. IEEE Trans. Software Eng. 5(3): 177-187(1979) BibTeX
[HoSa]
...
[JaKo]
Matti Jakobsson: Reducing block accesses in inverted files by partial clustering. Inf. Syst. 5(1): 1-5(1980) BibTeX
[Karp]
...
[Knut]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
[LaYu]
K. Lam, Clement T. Yu: A Clustered Search Algorithm Incorporating Arbitrary Term Dependencies. ACM Trans. Database Syst. 7(3): 500-508(1982) BibTeX
[LiYa]
J. H. Liou, S. Bing Yao: Multi-dimensional clustering for data base organizations. Inf. Syst. 2(4): 187-198(1977) BibTeX
[LoPo]
...
[MaRi]
Samy A. Mahmoud, J. Spruce Riordon: Optimal Allocation of Resources in Distributed Information Networks. ACM Trans. Database Syst. 1(1): 66-78(1976) BibTeX
[MaSe]
Salvatore T. March, Dennis G. Severance: The Determination of Efficient Record Segmentations and Blocking Factors for Shared Data Files. ACM Trans. Database Syst. 2(3): 279-296(1977) BibTeX
[OmSc]
...
[Salt]
...
[Schk]
Mario Schkolnick: A Clustering Algorithm for Hierarchical Structures. ACM Trans. Database Syst. 2(1): 27-44(1977) BibTeX
[Shne]
Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973) BibTeX
[SDD1]
Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie Jr.: Query Processing in a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 6(4): 602-625(1981) BibTeX
[Tuel]
William G. Tuel Jr.: Optimum Reorganization Points for Linearly Growing Files. ACM Trans. Database Syst. 3(1): 32-40(1978) BibTeX
[Van]
C. J. van Rijsbergen: Information Retrieval. Butterworth 1979, ISBN 0-408-70929-4
BibTeX
[VanR]
...
[UrOl]
...
[Wah]
...
[Yao]
S. Bing Yao, K. Sundar Das, Toby J. Teorey: A Dynamic Database Reorganization Algorithm. ACM Trans. Database Syst. 1(2): 159-174(1976) BibTeX
[YCTB]
Clement T. Yu, C. C. Chang: On the Design of a Query Processing Strategy in a Distributed Database Environment. SIGMOD Conference 1983: 30-39 BibTeX
[YGCC]
...
[YGCT]
...
[YSLC]
Clement T. Yu, M. K. Siu, K. Lam, C. H. Chen: File Allocation in Distributed Databases with Interaction between Files. VLDB 1983: 248-259 BibTeX
[YSLS]
Clement T. Yu, Cheing-Mei Suen, K. Lam, M. K. Siu: Adaptive Record Clustering. ACM Trans. Database Syst. 10(2): 180-204(1985) BibTeX
[YSLT]
...
[Yu]
...
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:39:42 2009