Article

Free access

Data independent recursion in deductive databases

Author:

Jeff NaughtonAuthors Info & Claims

PODS '86: Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems

Pages 267 - 279

https://doi.org/10.1145/6012.15420

Published: 01 June 1985 Publication History

PDF eReader

References

[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 Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[5]

Lawrence J. Henschen and Shamin A. Naqvi. On compiling queries in recursive first order databases. JAO~d, 31(1):47-85, 1984.

Digital Library

Google Scholar

[6]

Yannis E. loannides. Bounded recursion in deductive databases. Technical Report U@B/ERL M85/6, U@ Berkeley, February 1985.

Google Scholar

[7]

Jack Minker and Jean M. Nicolas. On recursire axioms in relational databases. Information S~stems, 8(1):1-13, 1982.

Google Scholar

[8]

Jeffrey F. Naughton. Data independent recursion in deductive databases. Stanford Tech Report, to appear.

Crossref

Google Scholar

[9]

Jeffrey F. Naughton. Optimizing function-free recursive inference rules. Stanford Tech Report, to appear.

Crossref

Google Scholar

[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 Scholar

[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 Scholar

[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.

Digital Library

Google Scholar

[13]

Jeffrey D. Ullman. Implementation of logical query languages for databases. TODS, 10(4):289--321, September 1985.

Digital Library

Google Scholar

Cited By

View all

Ioannidis Y(2023)A time bound on the materialization of some recursively defined viewsAlgorithmica10.1007/BF018404521:1-4(361-385)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840452
Kikot SKurucz APodolskii VZakharyaschev MLibkin LPichler RGuagliardo P(2021)Deciding Boundedness of Monadic SirupsProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458332(370-387)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458332
Berger GGottlob GPieris ASallinger ESuciu DSkritek SKoch C(2019)The Space-Efficient Core of VadalogProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319688(270-284)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319688
Show More Cited By

Recommendations

Deductive databases: achievements and future directions
Directions for future database research & development

In the recent years, Deductive Databases have been the focus of intense research, which has brought dramatic advances in theory, systems and applications. A salient feature of deductive databases is their capability of supporting a declarative, rule-...
Data updates and integrity checking in transformed deductive databases
Data independent recursion in deductive databases

Comments

Information & Contributors

Information

Published In

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

Chairman:
Avi Silberschatz

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: 01 June 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODS86

Sponsor:

PODS86: ACM SIGACT-SIGMOD Symposium on Principles of Database Systems

March 24 - 26, 1986

Massachusetts, Cambridge, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
291
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)8

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ioannidis Y(2023)A time bound on the materialization of some recursively defined viewsAlgorithmica10.1007/BF018404521:1-4(361-385)Online publication date: 22-Mar-2023
Kikot SKurucz APodolskii VZakharyaschev MLibkin LPichler RGuagliardo P(2021)Deciding Boundedness of Monadic SirupsProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458332(370-387)Online publication date: 20-Jun-2021
Berger GGottlob GPieris ASallinger ESuciu DSkritek SKoch C(2019)The Space-Efficient Core of VadalogProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319688(270-284)Online publication date: 25-Jun-2019
Maier DTekle KKifer MWarren D(2018)DatalogDeclarative Logic Programming10.1145/3191315.3191317(3-100)Online publication date: 1-Sep-2018
(2018)Declarative Logic ProgrammingundefinedOnline publication date: 1-Sep-2018
Brisaboa NFariña ALuaces MParamá J(2007)Chase of Recursive QueriesPerspectives of Systems Informatics10.1007/978-3-540-70881-0_12(112-123)Online publication date: 2007
Brisaboa NFariña, ALuaces MParamá J(2006)Chase of recursive queriesProceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics10.5555/1760700.1760714(112-123)Online publication date: 27-Jun-2006
Paramá JBrisaboa NPenabad MPlaces Á(2006)A semantic approach to optimize linear datalog programsActa Informatica10.1007/s00236-006-0025-943:5(341-370)Online publication date: 2-Nov-2006
Afrati FGergatsoulis MKatzouraki M(2005)On transformations into linear database logic programsPerspectives of System Informatics10.1007/3-540-62064-8_36(433-444)Online publication date: 3-Jun-2005
Du XIshii N(2005)Normalization of linear recursions based on graph transformationsInformation Systems and Data Management10.1007/3-540-60584-3_38(265-282)Online publication date: 2-Jun-2005
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Deductive databases: achievements and future directions

Data updates and integrity checking in transformed deductive databases