ACM SIGMOD Anthology VLDB dblp.uni-trier.de

On Retrieval from a Small Version of a Large Data Base.

Adrian Walker: On Retrieval from a Small Version of a Large Data Base. VLDB 1980: 47-54
@inproceedings{DBLP:conf/vldb/Walker80,
  author    = {Adrian Walker},
  title     = {On Retrieval from a Small Version of a Large Data Base},
  booktitle = {Sixth International Conference on Very Large Data Bases, October
               1-3, 1980, Montreal, Quebec, Canada, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1980},
  pages     = {47-54},
  ee        = {db/conf/vldb/Walker80.html},
  crossref  = {DBLP:conf/vldb/80},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

A person in the higher levels of a hierarchical organization may wish not to use a fully detailed data base, but rather an abstracted data base, perhaps dropping into detail in only a few areas. We compare answers from queries put to an abstracted data base with answers obtained by querying a full data base and then abstracting the result of the query. We show that, for some common relational retrievals, querying an abstracted data base always yields the correct information, plus, in some cases, some incorrect information, and we give simple conditions on the abstraction which ensure that only the correct information is fetched. For the cases in which the conditions may not hold, we suggest an ordering, called succinctness, for comparing the quality of different abstractions.

Copyright © 1980 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Sixth International Conference on Very Large Data Bases, October 1-3, 1980, Montreal, Quebec, Canada, Proceedings. IEEE Computer Society 1980
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977: 107-113 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
E. F. Codd: Further Normalization of the Data Base Relational Model. IBM Research Report, San Jose, California RJ909: (1971) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
...
[6]
Witold Lipski Jr.: On Semantic Issues Connected with Incomplete Information Databases. ACM Trans. Database Syst. 4(3): 262-296(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
Pavel Pudlák, Frederick N. Springsteel: Complexity in Mechanized Hypothesis Formation. Theor. Comput. Sci. 8: 203-225(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
...
[9]
...
[10]
A. Van der Mude, Adrian Walker: On the Inference of Stochastic Regular Grammars. Information and Control 38(3): 310-329(1978) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
...
[12]
...
[13]
...
[14]
Moshé M. Zloof: Query-by-Example: A Data Base Language. IBM Systems Journal 16(4): 324-343(1977) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Tue Mar 16 02:21:56 2010 by Michael Ley (ley@uni-trier.de)