Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/28659.28660acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free access

Database theory—past and future

Published: 01 June 1987 Publication History

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.

References

[1]
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
[2]
Armstrong, W W {1974} "Dependency structures of data base relationships," Proc 1974 IFIP Congress, pp 580-583, North Holland, Amsterdam
[3]
Bancdhon, F {1986} "A logle-programrmng/objeetoriented cocktad," SIGMOD Record, 15 3, pp 11-21
[4]
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
[5]
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
[6]
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
[7]
Bernsteln, P A and N Goodman{1981} "The power of natural semuoms," SIAM J Computing 10 4, pp 751-771
[8]
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
[9]
Cell, S and G Pelagattl {1984} Distributed Data. bases Pr, nc,ples and Systems, McGraw-Hill, New York
[10]
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-178
[11]
('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, Amsterdam
[12]
('od(l, E F {1970} "A relational model for large shared data banks," Comm ACM 13 6, pp 377-387
[13]
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
[14]
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
[15]
Fagln, R, {1977} "Multlvalued dependencies and a new normal forln for relational databases," A CM Trans on Database Systems 2 3, pp 262-278
[16]
Fagm, R {1983} "Degrees of aeycheity for hypergraphs and relational database schemes," J A CM 30 3, pp 514-550
[17]
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
[18]
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- 72
[19]
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
[20]
Gallaire, H and J Mmker {1978} Logsc and Databases, Plenum Press, New York
[21]
Khoshafian, S N and G P Copeland {1986} "Object identity," OOPSLA '86 Procee&ngs, ACM, New York, pp 406-416
[22]
Kuhns, J L {1967} "Answering questions by computer, a logical study," RM-5428-PR, Rand Corp, Santa Momea, Cahf
[23]
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
[24]
Ma~er, D {1983} Relat, onal Database Theory, Computer Science Press, R,ockv~lle, Md
[25]
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, London
[26]
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
[27]
Mendelzon, A O {1984} "Database states and their tableaux," A CM Truss on Database Systems 9 2, pp 264-282
[28]
Papa&mltnou, C H {1979} "The serlahzablhty of concurrent database updates," J A CM 26 4, pp 631-653
[29]
Papadlmltnou, C H {1986} The Theory of Database Concurrency Control, Computer Science Press, Rockvile, Md
[30]
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
[31]
Saglv, Y {1987} "Optimizing datalog programs," these proceedings
[32]
Sdbetschstz, A and Z Kedem {1980} "Consistency m hleraxchlcal database systems," J A CM 27 1, pp 72-80
[33]
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-32
[34]
Ullman, J D {1985} "Implementation of logical query languages for databases," A CM Trans on Database Systems 10 3, pp 289-321
[35]
Van Gelder, A {1986} "Negation as failure using tight derivations for general logic programs," Proc 1985 Syrup on Logzc Programming, IEEE, pp 127- 139
[36]
Yu, C T and M Z Ozsoyoglu {1979} "An Mgonthm for tree-query membershtp of a dmtrlbuted query," Proc IEEE COMPSAC, pp 306-312

Cited By

View all
  • (2023)Annotated Logics and Application—An OverviewAdvances in Applied Logics10.1007/978-3-031-35759-6_12(189-201)Online publication date: 31-Oct-2023
  • (2018)DatalogDeclarative Logic Programming10.1145/3191315.3191317(3-100)Online publication date: 1-Sep-2018
  • (2018)Declarative Logic ProgrammingundefinedOnline publication date: 1-Sep-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '87: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
June 1987
363 pages
ISBN:0897912233
DOI:10.1145/28659
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1987

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PODS '87
Sponsor:
PODS '87: Principles of database systems
March 23 - 25, 1987
California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)99
  • Downloads (Last 6 weeks)33
Reflects downloads up to 30 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Annotated Logics and Application—An OverviewAdvances in Applied Logics10.1007/978-3-031-35759-6_12(189-201)Online publication date: 31-Oct-2023
  • (2018)DatalogDeclarative Logic Programming10.1145/3191315.3191317(3-100)Online publication date: 1-Sep-2018
  • (2018)Declarative Logic ProgrammingundefinedOnline publication date: 1-Sep-2018
  • (2016)Guarded-Based Disjunctive Tuple-Generating DependenciesACM Transactions on Database Systems10.1145/297673641:4(1-45)Online publication date: 2-Nov-2016
  • (2013)Integration of an Informatics System in a High Throughput Experimentation. Description of a Global Framework Illustrated Through Several ExamplesOil & Gas Science and Technology – Revue d’IFP Energies nouvelles10.2516/ogst/201310968:3(445-468)Online publication date: 9-Jul-2013
  • (2005)Object-orientation based on semantic transformationsDatabase and Expert Systems Applications10.1007/BFb0034678(163-176)Online publication date: 26-Jun-2005
  • (2005)On the logical foundations of schema integration and evolution in heterogeneous database systemsDeductive and Object-Oriented Databases10.1007/3-540-57530-8_6(81-100)Online publication date: 27-May-2005
  • (2005)Concluding remarks and ongoing researchThe Nested Universal Relation Database Model10.1007/3-540-55493-9_7(159-161)Online publication date: 30-May-2005
  • (2005)Object-oriented database systems: Concepts and perspectivesDatabase Systems of the 90s10.1007/3-540-53397-4_36(154-197)Online publication date: 2-Jun-2005
  • (2005)Engineering the object-relation database model in O-raidFoundations of Data Organization and Algorithms10.1007/3-540-51295-0_144(389-403)Online publication date: 31-May-2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media