ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Extended Set Theory.

D. L. Childs: Extended Set Theory. VLDB 1977: 28-46
@inproceedings{DBLP:conf/vldb/Childs77,
  author    = {D. L. Childs},
  title     = {Extended Set Theory},
  booktitle = {Proceedings of the Third International Conference on Very Large
               Data Bases, October 6-8, 1977, Tokyo, Japan},
  publisher = {IEEE Computer Society},
  year      = {1977},
  pages     = {28-46},
  ee        = {db/conf/vldb/Childs77.html},
  crossref  = {DBLP:conf/vldb/77},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Three distinct components comprise an Information System: INFORMATION MANAGEMENT, DATA MANAGEMENT, and STORAGE MANAGEMENT. Until recently, all three have been subsumed under data management. As applications become more demanding, as support criteria become more complex, and as storage capacity becomes very large the need for functional independence of these three management areas has become more apparent. Recognition of this situation has been popularized through the phrase, "data independence", or more precisely, "data independence from information" and "data independence from storage*".

The difficulty in achieving data independence arises through the incompatibility of a complex information space being supported by a simple storage space. The popular, but limiting approach, has been to force the information space into a restrictive record space. This achieves a deceptive compatibility allowing only the appearance of data independence at the user level. This recordoriented approach has become pervasive for small databases even though it constrains user applications, requires substantial storage overhead, and imposes inherent processing inefficiencies.

As databases become very large and as distributed systems become desirable the need for inherent (not superficial) data independence becomes crucial. This paper is intended as a tutorial and will describe conditions for data independence and summarise the concepts of Extended Set Theory as a general model for expressing information systems embodying data independence. This generality will be demonstrated by considering some major problems pertinent to the design and support of very large, distributed, backend information systems.

It should be emphasized that Extended Set Theory is a formalism for expressing solutions and is not a specific solution in itself. Though "redundant membership condition", "distributed membership condition", and "set-theoretic interface" may be new concepts, Extended Set Theory does not preclude any current DBMS concepts, data structures, or existing implementations. Rather, Extended Set Theory embraces them all under a unifying model.

Copyright © 1977 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

Proceedings of the Third International Conference on Very Large Data Bases, October 6-8, 1977, Tokyo, Japan. IEEE Computer Society 1977
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[BA76]
...
[BA76]
E. Henry Beitz: Sets as a Model for Data Base Representation: Much Ado About Something. ACM Pacific 1975: 80-84 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BE71]
...
[Bo62]
...
[Ca74]
R. H. Canaday, R. D. Harrison, Evan L. Ivie, J. L. Ryder, L. A. Wehr: A Back-end Computer for Data Base Management. Commun. ACM 17(10): 575-582(1974) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[CH68A]
...
[CH68B]
...
[Ch74]
...
[CO70]
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
[CO72]
E. F. Codd: Relational Completeness of Data Base Sublanguages. In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DE66]
...
[DO69]
George G. Dodd: Elements of Data Management Systems. ACM Comput. Surv. 1(2): 117-133(1969) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Fo72]
...
[FR58]
...
[FR66]
...
[FR70]
James P. Fry: Introduction to Storage Structure Definition. SIGFIDET Workshop 1970: 315-328 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[FR70]
James P. Fry, Edgar H. Sibley: Evolution of Data-Base Management Systems. ACM Comput. Surv. 8(1): 7-42(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GO41]
...
[HA75]
...
[Ha76]
...
[HO73]
...
[HS70]
...
[KA77]
...
[KL69]
...
[KN69]
Donald E. Knuth: The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley 1969
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LO76]
...
[Lu77]
...
[MC68A]
...
[MC68B]
...
[ME67]
...
[MO73]
...
[NE65]
...
[PR73]
...
[QU45]
...
[RO76]
...
[SC70]
...
[SI74]
Edgar H. Sibley: On the Equivalence of Data Based Systems. SIGMOD Workshop, Vol. 2 1974: 43-76 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[SK57]
...
[ST64]
...
[SU60]
...
[WI52]
...
[ZA65]
Lotfi A. Zadeh: Fuzzy Sets. Information and Control 8(3): 338-353(1965) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

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