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}
}
BibTeX
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.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Proceedings of the Third International Conference on Very Large Data Bases, October 6-8, 1977, Tokyo, Japan.
IEEE Computer Society 1977
Contents BibTeX
References
- [BA76]
- ...
- [BA76]
- E. Henry Beitz:
Sets as a Model for Data Base Representation: Much Ado About Something.
ACM Pacific 1975: 80-84 BibTeX
- [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) BibTeX
- [CH68A]
- ...
- [CH68B]
- ...
- [Ch74]
- ...
- [CO70]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970) BibTeX
- [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) BibTeX
- [DE66]
- ...
- [DO69]
- George G. Dodd:
Elements of Data Management Systems.
ACM Comput. Surv. 1(2): 117-133(1969) BibTeX
- [Fo72]
- ...
- [FR58]
- ...
- [FR66]
- ...
- [FR70]
- James P. Fry:
Introduction to Storage Structure Definition.
SIGFIDET Workshop 1970: 315-328 BibTeX
- [FR70]
- James P. Fry, Edgar H. Sibley:
Evolution of Data-Base Management Systems.
ACM Comput. Surv. 8(1): 7-42(1976) BibTeX
- [GO41]
- ...
- [HA75]
- ...
- [Ha76]
- ...
- [HO73]
- ...
- [HS70]
- ...
- [KA77]
- ...
- [KL69]
- ...
- [KN69]
- Donald E. Knuth:
The Art of Computer Programming, Volume II: Seminumerical Algorithms.
Addison-Wesley 1969
BibTeX
- [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 BibTeX
- [SK57]
- ...
- [ST64]
- ...
- [SU60]
- ...
- [WI52]
- ...
- [ZA65]
- Lotfi A. Zadeh:
Fuzzy Sets.
Information and Control 8(3): 338-353(1965) BibTeX
Referenced by
- George P. Copeland, Setrag Khoshafian:
A Decomposition Storage Model.
SIGMOD Conference 1985: 268-279
- Scott M. Staley, David C. Anderson:
Executable E-R Specifications for Database Schema Design.
ER 1985: 160-169
- Barron C. Housel, Vance E. Waddle, S. Bing Yao:
The Functional Dependency Model for Logical Database Design.
VLDB 1979: 194-208
- Larry Kerschberg, Anthony C. Klug, Dennis Tsichritzis:
A Taxonomy of Data Models.
VLDB 1976: 43-64
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings (1977-1981): Copyright © by IEEE,
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:44:56 2009