A Multi-Resolution Relational Data Model.

Robert L. Read, Donald S. Fussell, Abraham Silberschatz: A Multi-Resolution Relational Data Model. VLDB 1992: 139-150

@inproceedings{DBLP:conf/vldb/ReadFS92,
  author    = {Robert L. Read and
               Donald S. Fussell and
               Abraham Silberschatz},
  editor    = {Li-Yan Yuan},
  title     = {A Multi-Resolution Relational Data Model},
  booktitle = {18th International Conference on Very Large Data Bases, August
               23-27, 1992, Vancouver, Canada, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1992},
  isbn      = {1-55860-151-1},
  pages     = {139-150},
  ee        = {db/conf/vldb/ReadFS92.html},
  crossref  = {DBLP:conf/vldb/92},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The use of data at different levels of information content is essential to the performance of multimedia, scientific, and other large databases because it cansignificantly decrease I/O and communication costs. The performance advantages of such a multi-resolution scheme can only befully exploited by a data model that supports the convenient retrieval of data at different levels of information content. In this paper we extend the relational data model to support multi- resolution data retrieval. In particular, we introduce a new partial set construct, called the sandbag, that can support multi-resolution for the types of data used in a wide variety of next-generation database applications, as well as traditional applications. We extend the relational algebra operators to analogous operators on sandbags. The resulting extension of the relational algebra is sound and forms a foundation for future database management systems that support these types of next-generation applications.

Copyright © 1992 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb8997 or /cdrom

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

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Li-Yan Yuan (Ed.): 18th International Conference on Very Large Data Bases, August 23-27, 1992, Vancouver, Canada, Proceedings. Morgan Kaufmann 1992, ISBN 1-55860-151-1
Contents

References

[1]: François Bancilhon, Setrag Khoshafian: A Calculus for Complex Objects. PODS 1986: 53-60
[2]: Peter Buneman, Susan B. Davidson, Aaron Watters: A Semantics for Complex Objects and Approximate Queries. PODS 1988: 305-314
[3]: Joan M. Morrissey: Imprecise Information and Uncertainty in Information Systems. ACM Trans. Inf. Syst. 8(2): 159-180(1990)
[4]: David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents
[5]: Susan V. Vrbsky, Jane W.-S. Liu: An Object-Oriented Query Processor that Produces Monotonically Improving Approximate Answers. ICDE 1991: 472-481
[6]: Ken-Chih Liu, Rajshekhar Sunderraman: On Representing Indefinite and Maybe Information in Relational Databases. ICDE 1988: 250-257
[7]: Tomasz Imielinski, Witold Lipski Jr.: On Representing Incomplete Information in a Relational Data Base. VLDB 1981: 388-397
[8]: Tomasz Imielinski, Witold Lipski Jr.: Incomplete Information in Relational Databases. J. ACM 31(4): 761-791(1984)
[9]: Raymond Reiter: A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM 33(2): 349-370(1986)
[10]: John Grant: Partial Values in a Tabular Database Model. Inf. Process. Lett. 9(2): 97-99(1979)
[11]: Linda G. DeMichiel: Resolving Database Incompatibility: An Approach to Performing Relational Operations over Mismatched Domains. IEEE Trans. Knowl. Data Eng. 1(4): 485-493(1989)
[12]: ...
[13]: Peter Buneman, Achim Jung, Atsushi Ohori: Using Powerdomains to Generalize Relational Databases. Theor. Comput. Sci. 91(1): 23-55(1991)
[14]: Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman: Database Systems: Achievements and Opportunities. Commun. ACM 34(10): 110-120(1991)
[15]: ...
[16]: ...
[17]: ...
[18]: ...
[19]: ...
[20]: ...
[21]: ...
[22]: ...
[23]: ...
[24]: ...
[25]: ...
[26]: Richard Hull: Relative Information Capacity of Simple Relational Database Schemata. SIAM J. Comput. 15(3): 856-886(1986)
[27]: Chung-Dak Shum, Richard R. Muntz: An Information-Theoretic Study on Aggregate Responses. VLDB 1988: 479-490
[28]: ...
[29]: ...
[30]: ...
[31]: Don S. Batory: On Searching Transposed Files. ACM Trans. Database Syst. 4(4): 531-544(1979)
[32]: Harry K. T. Wong, Hsiu-Fen Liu, Frank Olken, Doron Rotem, Linda Wong: Bit Transposed Files. VLDB 1985: 448-457