J. D. Ullman
ABSTRACT
We briefly sketch the development of the various branches of database theory. One important branch is the theory of relational databases, including such areas as dependency theory, universal-relation theory, and hypergraph theory. A second important branch is the theory of concurrency control and distributed databases. Two other branches have not in the past been given the attention they deserve. One of these is “logic and databases,” and the second is “object-oriented database systems,” which to my thinking includes systems based on the network or hierarchical data models. Both these areas are going to be more influential in the future.
- Alio, A V ,m~l ! D UIIma~n {1979} "Unlvers~dlty ot ~lata retrieval languages," Proc S,zth A CM Symposium on Pmnc,ples of Programmsn9 Languages, pp 110 120 Google Scholar
Digital Library
- Armstrong, W W {1974} "Dependency structures of data base relationships," Proc 1974 IFIP Congress, pp 580-583, North Holland, AmsterdamGoogle Scholar
- Bancdhon, F {1986} "A logle-programrmng/objeetoriented cocktad," SIGMOD Record, 15 3, pp 11-21 Google ScholarDigital Library
- Bancllhon, F and R Ramakrmhnnn {1986} "An amateur's Introduction to reeursive query-processing strategies," A CM SIGMOD Internatsonal Sympossum on Management of Data, pp 1-49 Google ScholarDigital Library
- Beerl, C and P A Bernstem {1979} "Computational problems related to the design of normal form relation sthenles," 4CM 7)'ans on Database Systems 4 1, pp 30-39 Google ScholarDigital Library
- B,'rnsteln, P A {1976} "Synthemzmg thtrd normal form relations from functional dependencies," A CM fra,~s on Database Systems 1 4, pp 277-298 Google ScholarDigital Library
- Bernsteln, P A and N Goodman{1981} "The power of natural semuoms," SIAM J Computing 10 4, pp 751-771Google Scholar
- Bosak, R, R F Chppmger, C Dobbs, tt Goldfinger, R B Jasper, W Keatmg, G Kendnek, and J E Summer {1962} "An reformation algebra," Comm 4CM 5 4, pp 190-204 Google ScholarDigital Library
- Cell, S and G Pelagattl {1984} Distributed Data. bases Pr, nc,ples and Systems, McGraw-Hill, New York Google ScholarDigital Library
- Chandra, A K and D Harel {1980} "Computable ,itl~'rles for relational database systems," J Computer and '~1~l~ m bc ,ences 21 2, pp 156-178Google Scholar
- ('hllds, D L {1968} "Feastbdlty of a set-theoretical tl,tta btructure~a general structure based on a reton~tltuted definition of relation," Proc 1968 IFIP C'ongress, pp 162-172, North Holland, AmsterdamGoogle Scholar
- ('od(l, E F {1970} "A relational model for large shared data banks," Comm ACM 13 6, pp 377-387 Google ScholarDigital Library
- D}Paola, R A {1969} "The recurstve unsolvabfllty of the decision problem for a class of definite formulas," l I CM 16 2, pp 324-327 Google ScholarDigital Library
- Eswaran, K P, J N Gray, R A Lone, and I L Tralger {1976} "The notions of consistency and predicate locks m a database system," Comm A CM 19 11, pp 624-633 Google ScholarDigital Library
- Fagln, R, {1977} "Multlvalued dependencies and a new normal forln for relational databases," A CM Trans on Database Systems 2 3, pp 262-278 Google ScholarDigital Library
- Fagm, R {1983} "Degrees of aeycheity for hypergraphs and relational database schemes," J A CM 30 3, pp 514-550 Google ScholarDigital Library
- Fagln, R ,A O Mendelzon, and J D Ullman {1982} "A s~mpllfied universal relation assumption and ~ts properties," A CM T~ns on Database Systems 7 3, pp 343-360 Google ScholarDigital Library
- Fagm, tt and M Y Vat& {1986} "The theory of data dependencies---a survey," in Mathematics of lnformatson Processing (M Anshel and W Gewirtz, eds ), Sympossa zn Apphed Mathematics 34, pp 19- 72Google Scholar
- Ffllat, A I and L A Kranmg {1970} "Generahzed organmatlon of large data-bases a set theoretic approach to relations," MIT MAC TR-70, June, 1970 Google ScholarDigital Library
- Gallaire, H and J Mmker {1978} Logsc and Databases, Plenum Press, New York Google ScholarDigital Library
- Khoshafian, S N and G P Copeland {1986} "Object identity," OOPSLA '86 Procee&ngs, ACM, New York, pp 406-416 Google ScholarDigital Library
- Kuhns, J L {1967} "Answering questions by computer, a logical study," RM-5428-PR, Rand Corp, Santa Momea, CahfGoogle Scholar
- Kuper, G and M Y Vardt {1985} "On the expressive power of the logical data model," A CM SIGMOD International Symposzum on Management of Data, pp 180-189 Google ScholarDigital Library
- Ma~er, D {1983} Relat, onal Database Theory, Computer Science Press, R,ockv~lle, MdGoogle Scholar
- Mulet, D, D Rozenshte~n, and D S Warren {198b} "Window Functions," m Advances m Comput,ng Research 3 (P Kanellakts, ed ), pp 213-246, JAI Press, LondonGoogle Scholar
- Maler, D, J Stem, A Otis, and A Purdy {1986} "Development of an object-oriented DBMS," OOP- SI, A '86 Procee&ngs, ACM, New York, pp 472-482 Google ScholarDigital Library
- Mendelzon, A O {1984} "Database states and their tableaux," A CM Truss on Database Systems 9 2, pp 264-282 Google ScholarDigital Library
- Papa&mltnou, C H {1979} "The serlahzablhty of concurrent database updates," J A CM 26 4, pp 631-653 Google ScholarDigital Library
- Papadlmltnou, C H {1986} The Theory of Database Concurrency Control, Computer Science Press, Rockvile, Md Google ScholarDigital Library
- Saglv, Y {1983} "A characterization of globally conmtent databases and the,r correct access paths," A CM Trans on Database Systems 8 2, pp 266-286 Google ScholarDigital Library
- Saglv, Y {1987} "Optimizing datalog programs," these proceedings Google ScholarDigital Library
- Sdbetschstz, A and Z Kedem {1980} "Consistency m hleraxchlcal database systems," J A CM 27 1, pp 72-80 Google ScholarDigital Library
- Stearns, R E, P M Lewis II, and D J Rosenkrantz {1976} "Concurrency control for database systerns," Proc Seventeenth Annual IEEE Sympostttm on Foundattons of Computer Sctence, pp 19-32Google Scholar
- Ullman, J D {1985} "Implementation of logical query languages for databases," A CM Trans on Database Systems 10 3, pp 289-321 Google ScholarDigital Library
- Van Gelder, A {1986} "Negation as failure using tight derivations for general logic programs," Proc 1985 Syrup on Logzc Programming, IEEE, pp 127- 139Google Scholar
- Yu, C T and M Z Ozsoyoglu {1979} "An Mgonthm for tree-query membershtp of a dmtrlbuted query," Proc IEEE COMPSAC, pp 306-312Google Scholar
Index Terms
- Database theory—past and future
Recommendations
Future Trends in Database Systems
The author discusses the likely evolution of commercial data managers over the next several years. Topics to be covered include the following: why SQL (structured query language) has become a universal standard; who can benefit from SQL standardization; ...
B-trees and databases, past and future
Software pioneersB-Trees are a data structure for organizing and managing very large data volumes on peripheral computer stores. B-Trees were developed in 1969 by R. Bayer and E. McCreight; they have superb properties with respect to performance and scalability in ...
Comments