| Heterogeneous databases and high level abstraction |
| Full text |
Pdf
(228 KB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
table of contents
Pingree Park, Colorado, United States
Pages: 135 - 137
Year of Publication: 1980
ISBN:0-89791-031-1
Also published in ...
|
|
Author
|
|
Randy H. Katz
|
Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 35, Citation Count: 0
|
|
|
ABSTRACT
A heterogeneous database management system combines multiple dissimilar models of data within a single integrated system. The objective is to allow a user to access data independently of how it is actually organized. For example, a user may access a database as though it were stored relationally (i.e., in tables) [CODD70], even though it is actually stored as a CODASYL/DBTG or network database [CODA71]. In addition, different subpieces of the database may be organized under different data models. The heterogeneous database system must present these to the user as an integrated whole. The user's model of his data may be different from any of the models chosen to implement it. Rather than construct a new database system from scratch, we are interested in constructing a heterogeneous system out of existing systems. The key difficulties with this approach are: (1) the formulation of database design methods that are applicable to a variety of different data models, and (2) the development of techniques to translate programs and data between dissimilar data models. In this paper, we briefly describe how high level abstraction has been applied to these problems. The use of abstraction in database systems is related to the application of abstraction techniques in programming languages and artificial intelligence research.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
CODASYL Data Base Task Group, April 1971 Report, A.C.M., (Apr 71).
|
 |
3
|
|
| |
4
|
Gotlieb, C. C., Tompa, F. W., "Choosing a Storage Schema," Acta Informatica, V 3, pp. 297-319, 1974.
|
 |
5
|
|
| |
6
|
Katz, R. H., Wong, E., "An Access Path Model for Program Decompilation," submitted for publication to A.C.M. Trans. on Data Base Sys.
|
| |
7
|
|
Peer to Peer - Readers of this Article have also read:
-
Web application security assessment by fault injection and behavior monitoring
Proceedings of the 12th international conference on World Wide Web
Yao-Wen Huang
, Shih-Kun Huang
, Tsung-Po Lin
, Chung-Hung Tsai
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|