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

Data independent recursion in deductive databases

Published:01 June 1985Publication History
First page image

References

  1. 1.Alfred V. Aho, Yehoshua Sagiv, ud Jeffrey D. UUman. Equivalence of relational expressions. SIAM Journal of Gomp#ting, 8(2):218- 246, 1979.Google ScholarGoogle Scholar
  2. 2.Alfred V. Aho and Jeffrey D. Ullman. Universality of data retrieval languages. In Proceedinga of the Sixth A GM Syrnpoaiurn on Principle8 of Programming Languages, pages 110-120, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Francois Baaxcilhon, David Maier, Yehoshua Sa. giv, and Jeffrey D. Ullman. Magic sets and other strange ways to implement logic programs. October 1985. To appear in PODS86. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relstionxl data bases. In Gonference Record o/ the Ninth Annual A CM Sympo:ium on Theory of Corapu~ing, pages 77-90, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Lawrence J. Henschen and Shamin A. Naqvi. On compiling queries in recursive first order databases. JAO~d, 31(1):47-85, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Yannis E. loannides. Bounded recursion in deductive databases. Technical Report U@B/ERL M85/6, U@ Berkeley, February 1985.Google ScholarGoogle Scholar
  7. 7.Jack Minker and Jean M. Nicolas. On recursire axioms in relational databases. Information S~stems, 8(1):1-13, 1982.Google ScholarGoogle Scholar
  8. 8.Jeffrey F. Naughton. Data independent recursion in deductive databases. Stanford Tech Report, to appear. Google ScholarGoogle Scholar
  9. 9.Jeffrey F. Naughton. Optimizing function-free recursive inference rules. Stanford Tech Report, to appear. Google ScholarGoogle Scholar
  10. 10.Raymond Reiter. Deductive queJtion-answering on relational databases. In H. G sllaire and J. Minker, editors, Locke ~nd Databases, pages 149- 177, Plenum Press, New York, 1978.Google ScholarGoogle Scholar
  11. 11.Raymond Reiter. On closed world databases. In Herve Ganaire and Jack Minker, editors, Logic sad Databo~es, pages 55-76, Plenum Preu, New York, 1978.Google ScholarGoogle Scholar
  12. 12.Yehoshua Sagiv. On computing restricted projections of representative instances. In Proceed- ~aga o~ the A GM SIGA GT-SIGMOD $~mpoa~um o,~ P~,~c~plee o)' Da~aba~em 8yeten~, pages 171- 180, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Jeffrey D. Ullman. Implementation of logical query languages for databases. TODS, 10(4):289--321, September 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Data independent recursion in deductive databases

                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 '86: Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
                  June 1985
                  293 pages
                  ISBN:0897911792
                  DOI:10.1145/6012

                  Copyright © 1985 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: 1 June 1985

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate642of2,707submissions,24%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader