|
ABSTRACT
Relaxing the assumption that relations are always in First-Normal-Form (1NF) necessitates a reexamination of the fundamentals of relational database theory. In this paper we take a first step towards unifying the various theories of ¬1NF databases. We start by determining an appropriate model to couch our formalisms in. We then define an extended relational calculus as the theoretical basis for our ¬1NF database query language. We define a minimal extended relational algebra and prove its equivalence to the ¬1NF relational calculus. We define a class of ¬1NF relations with certain “good” properties and extend our algebra operators to work within this domain. We prove certain desirable equivalences that hold only if we restrict our language to this domain.
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
|
|
| |
3
|
BANCILHON, F., FORTIN, D., GAMERMAN, S., LAUBIN, J. M., RICHARD, P., SCHOLL, M., TUSERA, D., AND VERROUST, A. VERSO: A relational backend database machine. In Advanced Database Machine Architecture, D. K. Hsiao, Ed. Prentice-Hall, Englewood Cliffs, N.J., 1983, pp. 1-18.
|
 |
4
|
|
| |
5
|
CODD, E.F. Relational completeness of data base sublanguages. In Courant Computer Science Symposium 6 on Data Base Systems. R. Rustin, Ed., 1971, 65-98.
|
| |
6
|
EPSTEIN, R. Techniques for processing of aggregates in relational database systems. Memorandum UCB/ERL M79/8, Electronics Research Laboratory, University of California, Berkeley, 1979.
|
| |
7
|
|
| |
8
|
FISCHER, P. C., AND THOMAS, S. Operators for non-first-normal-form relations. In Proceedings of the 7th International Computer Software Applications Conference (Chicago, Nov. 1983), pp. 464-475.
|
 |
9
|
|
| |
10
|
|
 |
11
|
|
 |
12
|
|
 |
13
|
|
 |
14
|
|
| |
15
|
JAESCHKE, G. Nonrecursive algebra for relations with relation valued attributes. Tech. Rep. 84.12.001, Heidelberg Scientific Center, IBM Germany, 1984.
|
| |
16
|
JAESCHKE, G. Recursive algebra for relations with relation valued attributes. Tech. Rep. 84.01.003, Heidelberg Scientific Center, IBM Germany, 1984.
|
 |
17
|
|
| |
18
|
KAMBAYASHI, Y., TANAKA, K., AND TAKEDA, K. Synthesis of unnormalized relations incorporating more meaning. Inf. Sci. 29 (1983), 201-247.
|
 |
19
|
|
| |
20
|
KORTH, H. F., AND SILBERSCHATZ, A. A user-friendly operating system interface based on the relational data model. In International Symposium on New Directions in Computing (Trondheim Aug. 1985), pp. 302-310.
|
 |
21
|
|
| |
22
|
MAK{NOUCH{, A. A consideration on normal form of not-necessarily-normalized relation in the relational data model, in Proceedings of the Third International Conference on Very Large Data Bases (Tokyo, Oct. 1977), pp. 447-453.
|
| |
23
|
ORMAN, L. Semantics of indexed data sets. Working Paper 81-05, Graduate School of Management, Cornell University, Ithaca, N.Y., Feb. 1981.
|
| |
24
|
|
 |
25
|
|
| |
26
|
|
 |
27
|
|
| |
28
|
|
| |
29
|
|
| |
30
|
SCHEK, H. Towards a basic relational NF~ algebra processor. In Proceedings q{ the International Conference on Foundations of Data Organization (Kyoto, May 1985), pp. 173-182.
|
| |
31
|
|
| |
32
|
|
 |
33
|
|
| |
34
|
|
CITED BY 60
|
|
|
|
|
|
|
|
|
|
|
|
|
Ana Ma Fermoso , Roberto Berjon , Encarnacion Beato , Montserrat Mateos , Miguel Angel Sanchez , Maribel Manzano , Ma Jose Gil, A new system for integrating information from libraries' catalogues to MODS format, International Journal of Metadata, Semantics and Ontologies, v.2 n.3, p.201-210, March 2007
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Hiroshi Ishikawa , Fumio Suzuki , Fumihiko Kozakura , Akifumi Makinouchi , Mika Miyagishima , Yoshio Izumida , Masaaki Aoshima , Yasuo Yamane, The model, language, and implementation of an object-oriented multimedia knowledge base management system, ACM Transactions on Database Systems (TODS), v.18 n.1, p.1-50, March 1993
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yannis Papakonstantinou , Vinayak Borkar , Maxim Orgiyan , Kostas Stathatos , Lucian Suta , Vasilis Vassalos , Pavel Velikhov, XML queries and algebra in the Enosys integration platform, Data & Knowledge Engineering, v.44 n.3, p.299-322, March 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Don Goelman : Reviewer"
Intended primarily for the research community, this interesting paper on
theoretical principles of database systems will also interest those
concerned with applications. A basic familiarity with the relational model
is necessary, and familiarity
more...
Peer to Peer - Readers of this Article have also read:
-
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
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|