skip to main content
10.1145/212433.212436acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free Access

Database metatheory: asking the big queries

Published:22 May 1995Publication History
First page image

References

  1. Ar.Artistotle Ethics bk. X, ch. 7; Metaphysics ch. 2.Google ScholarGoogle Scholar
  2. As.Astrahan, M. M., et al. "System R: A relational approach to data management," ACM Transactions on Database Systems, 1, 2, pp. 97-137, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. BHG.Bernstein, P., V. Hadzilacos, and N. Goodman Concurrency control and recovery in database systems, Addison-Wesley, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. BCN.Batini, Carlo, Stefano Ceri, and Shamkant Navathe Conceptual database design: an entity-relationship approach Benjamin Cummings, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. BDK.Ba.ncilhon, Francois, Claude Delobel, and Paris C. Kanellakis Building an object-oriented database system: the story of 02, Morgan Kaufman, 1992.Google ScholarGoogle Scholar
  6. BPT.Buss, S., C. H. Papadimitriou, J. N. Tsitsiklis "On the predictability of coupled finite automata: an allegory on chaos," Proc. 31st FOCS Conference, pp. 788-793, 1990. Also, to appear in Complex Systems.Google ScholarGoogle Scholar
  7. Co1.Codd, E. F., "A relational model for large shared data banks," C.ACM, 13, 6, pp. 377-387, 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Co2.Codd, E. F., "Relational completeness of data base sublanguages," in Data Base Systems (R. Rustin, ed.), pp. 65-98, Prectice-tiall, 1972.Google ScholarGoogle Scholar
  9. Cook.Cook, S. A., "The complexity of theorem-proving procedures," Proc. 3rd FOCS, pp. 151-158, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. DBTG.CODASYL Data Base Task Group April 1971 Report, ACM, 1971.Google ScholarGoogle Scholar
  11. ER.Erd6s, P., and A. R6nyi "On the evolution of random graphs," Magyar Tud. Akad. Mat. Kut. Int. K3zl, 5, pp. 17-61, 1960.Google ScholarGoogle Scholar
  12. Fa.Fagin, R., "Generalized first-order spectra and polynomial-time recognizable sets," in Complexity of Computation, R. M. Karp (editor), SIAM-AMS Proceedings vol. 7, pp. 43-73 1974.Google ScholarGoogle Scholar
  13. Fer.Ferr6, Frederick Philosophy of technology, Prentice Hall, 1988.Google ScholarGoogle Scholar
  14. Fe.Feyerabend, Paul Aga,nst method, Verso, 1993 (third edition).Google ScholarGoogle Scholar
  15. GR.Gray, J., and A. Reuter Transaction processing: concepts and techniques, Morgan Kaufman, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Ka.Karp, R. M., "Mapping the genome: Some combinatorial problems arising in molecular biology," Proc. 25th STOC Conference, pp. 278-285, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ki.Kitcher, Philip, "The division of cognitive labor (conflicts between individual and collective rationality in science)," J. of Philosophy, 87, 1, pp. 1-18, 1990.Google ScholarGoogle Scholar
  18. Kn.Knuth, Donald E., "Theory and practice," EATCS Bulletin, 27, pp. 14-21, Oct. 1985. See also Theoretzcal Computer Sczence, 90, 1, pp. 1-15, Nov. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Ku.Kuhn, Thomas S, The structure of scientific revolutions, The University of Chicago Press, 1962.Google ScholarGoogle Scholar
  20. La.Lakatos, imre, Mathematics, science, and epistemology, Cambridge University Press, 1978.Google ScholarGoogle Scholar
  21. LB.Lekkerkerker, C. B., and J. Boland "Representation of a finite graph by a set of intervals on the real line," Fund. Math, 51, pp. 45-64, 1962.Google ScholarGoogle ScholarCross RefCross Ref
  22. Pa1.Papadimitriou, Christos H., The theory of database concurrency control, Computer Science Press, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Pa2.Papadimitriou, Christos H., Computational complexity, Addison-Wesley, 1994.Google ScholarGoogle Scholar
  24. PY.Papadimitriou, C. H., and M. Yannakakis "Complexity as bounded rationality, Proc. 26th STOC Conference, pp. 726-733, #994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Ra1.Ramakrishnan, Raghu (editor), Aplications of logic programming, Kluwer Academic Publishers, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Ra2.Ramakrishnan, Raghu, private e-mail communication to Moshe Vardi, September 1994.Google ScholarGoogle Scholar
  27. Sig.Sigmund, Karl, Games of life: explorations in ecology, evolution, and behaviour, Oxford University Press, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Si.Simon, Herbert, The sciences of the artificial, MIT Press, 1981 (second edition). Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. SWKH.Stonebreaker, M., E. Wong, P. Kreps, and G. Held "The design and implementation of INGRES," A CM Transactions on Database Systems, 1, 3, pp. 189-222, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Ul1.Ullman, Jeffrey, Principles of database systems, Computer Science Press, 1982 (second edition). Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Ul2.Ullman, Jeffrey, "The role of theory today," manuscript, 1994.Google ScholarGoogle Scholar

Index Terms

  1. Database metatheory: asking the big queries

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              PODS '95: Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
              May 1995
              300 pages
              ISBN:0897917308
              DOI:10.1145/212433

              Copyright © 1995 ACM

              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]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 22 May 1995

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              PODS '95 Paper Acceptance Rate25of94submissions,27%Overall Acceptance Rate642of2,707submissions,24%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader