Article

Free access

On the first-order expressibility of recursive queries

Author:

S. S. CosmadakisAuthors Info & Claims

PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 311 - 323

https://doi.org/10.1145/73721.73752

Published: 29 March 1989 Publication History

Abstract

A Datalog program is bounded iff it is equivalent to a recursion-free Datalog program. We show that, for some classes of Datalog programs, expressibility in first-order query languages coincides with boundedness. Our results imply that testing first-order expressibility is undecidable for binary programs, decidable for monadic programs, and complete for Σ⁰₂.

References

[1]

Aho, V.H., Ullman, J.D" Universality of data retrieval languages. Proc. 6th A CM Syrup. on Principles of Programming Languages, 1979, pp. 110-117.

Digital Library

[2]

Bancilhon, F., Ramakrishnan, R.: An amateur's introduction to recursive query processing strategies. Proc. ACId Conf. on Managemen~ of Data, Washington, 1986, pp. 16-52.

Digital Library

[3]

Beeri, C., Kanellakis, P.C., Bancilhon, F., Ramakrishnan, R.: Bounds on the propagation of selection into logic programs. Proc. 6th A CM Syrup. on Principles of Database Systems, San Diego, 1987~ pp. 214-226.

Digital Library

[4]

Blass, A., Harary, F." Properties of almost all graphs and complexes, jr. Graph Theory 3(1979), pp. 225-240.

[5]

Chandra, A.K" Programming primitives for database languages. Proc. 8th A CM Syrup. on Principles of Programming Languages, Williamsburg, 1981, pp. 50-62.

Digital Library

[6]

Chandra, A.K., Hard, D." Computable queries for relational databases. J. Computer and Sysiems Sciences 21(1980), pp. 156-178.

[7]

Chandra, A.K., Harel, D." Structure and Complexity of Relational Queries. J. Computer and Systems Sciences 25(1982), pp. 99-128.

[8]

Chandra, A.K., liarel, D." Hornclause queries and generalizations. J. Logic Programming 1(1985), pp. 1-15.

[9]

Chandra, A.K., Merlin, P.M" Optimal implementation of conjunctive queries in relational databases. Proc. 9th A CM Syrup. on Theory of Computing, Boulder, 1977, pp. 77-90.

Digital Library

[10]

Chang, C.C., Keisler, H.J." Model Theory. North-Holland, 1973.

[11]

Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y" Decidable optimization problems for database logic programs. Proe. ~Oth A CM Syrup. on Theory of Computing, Chicago, 1988, pp. 477-490.

Digital Library

[12]

Cosmadakis, S.S., Kanellakis, P.C.: Parallel evaluation of recursive rule queries. Proc. 5th A CM Syrup. on Principles of Database Systems, Cambridge, 1986, pp. 280-293.

Digital Library

[13]

Fagin, R." Monadic generalized spectra, geitschr, f. math. Logik nnd Grunlagen d. Math. 21(1975), pp. 89-96.

[14]

Fraiss~, R. Sur les classifications des systemes de relations. Publications So. Universitd Alger 1, No.I(1954).

[15]

Gaifman, H." On local and nonlocal properties. Proc. Logic Colloquium (J. Sterne, ed.), North-Holland, 1981, pp. 105-132.

[16]

Gaifman, H., Mairson, H., Sagiv, Y., Vardi M.Y." Undecidable optimization problems for database logic programs. Proc. ~nd IEEE Syrup. on Logic in Computer Science, Ithaca, 1987, pp. 106-115.

[17]

Gaifman, H., Va.rdi, M.Y.: A simple proof that connectivity of graphs is not first-order definable. Bull. EATCS 26(1985), pp. 43-45.

[18]

Gallaire, H., Minker, J" Logic and Databases. Plenum Press, 1978.

Digital Library

[19]

Henschen, L.J., Na.qvi, S.A" On compiling queries in recursive firstorder databases. J. ACM 31(1984), pp. 47-85.

Digital Library

[20]

immerman, N." Number of quantifiers is better than number of tape cells. J. Computer and System Sciences 22(1981), pp. 384-406.

[21]

Immerman, N." Relational queries computable in polynomial time. Information and Control 68(1986), pp. 86-104.

Digital Library

[22]

ioannidis, Y.E." A time bound on the materializa.tion of some recursively defined views. Proc. 1lib Int 'l Conf. on VerTI Large Data Bases, Stockhohn, 1985, pp. 219-226.

[23]

Ka,nellakis, P.C." Logic programruing and parallel complexity, in Foundations of Deductive Databases and Logic Programming, J. Minker ed., (to appear).

Digital Library

[24]

Kola,itis, P.- Personal communication, 1987.

[25]

Mater, D., Ullman, J.D., Vardi, M.Y." On the foundations of the universal relation model. A GM Trans. on Database Systems 9(1984), pp. 283-308.

Digital Library

[26]

Mater, D., Warren, D.S." Computing with Logic: Logic Programming with Prolo#, Benjamin Cummings, 1988.

Digital Library

[27]

Moschovakis, Y.N.- Elementary Induction on Abstract Structures. North-Holland, 1974.

Digital Library

[28]

Naughton, J.F.: Data independent recursion in deductive databases. Proc. 5th A CM Syrup. on Principles of Database Systems, Cambridge, 1986, pp. 267-279. Full version - Stanford University Technical Report STAN-CS-86-1102, to appear in J. Computer and System Sciences.

[29]

Naughton, J.F., Sngiv, Y." A decidable class of bounded recursions. Proc. 6th A CM STlmp. on Principles of Database S~tslems, San Diego, 1987, pp. 227-236.

Digital Library

[30]

Sa.giv, Y.: On computing restricted projections of representative instances. Proc. ~th AUM S~mp. on Principles of Database S~lslems, Portland, 1985, pp. 171-180.

Digital Library

[31]

Ullman, J.D' Implementation of logical query languages for databases. A CM Trans. on Database S~stems I0(1985), pp. 289-321.

Digital Library

[32]

Vardi, M.Y." The complexity of relational query languages. Proc. ldth A CM S~tmp. on Theory of Computing, San Francisco, 1982, pp. 137- 146.

Digital Library

[33]

Vardi, M.Y.: Decidability and Undecidablity Results for Boundedness of Linear Reeursive Queries. Proc. 7th A CM Syrup. on Principles of Database Systems, Austin, Ma.rch 1988, pp. 341-351.

Digital Library

Cited By

Chen YLin FZhang YZhou Y(2011)Loop-separable programs and their first-order definabilityArtificial Intelligence10.1016/j.artint.2010.12.001175:3-4(890-913)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.artint.2010.12.001
Zhang YZhou Y(2010)On the progression semantics and boundedness of answer set programsProceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031748.3031814(518-526)Online publication date: 9-May-2010
https://dl.acm.org/doi/10.5555/3031748.3031814
Cosmadakis SFoustoucos ESidiropoulos A(2010)Undecidability and intractability results concerning datalog programs and their persistency numbersACM Transactions on Computational Logic10.1145/1656242.165624711:2(1-29)Online publication date: 22-Jan-2010
https://dl.acm.org/doi/10.1145/1656242.1656247
Show More Cited By

Index Terms

On the first-order expressibility of recursive queries
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
    2. Query languages
2. Theory of computation

Recommendations

First-order expressibility and boundedness of disjunctive logic programs
IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ...
Proving Isomorphism of First-Order Logic Proof Systems in HOL
Towards First-Order Nonmonotonic Reasoning
LPNMR '99: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning

We investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in first-order MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

March 1989

401 pages

ISBN:0897913086

DOI:10.1145/73721

Chairman:
Avi Silberschatz
Univ. of Texas, Austin

Copyright © 1989 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 March 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODS '89

Sponsor:

PODS '89: Principles of database systems

Pennsylvania, Philadelphia, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
321
Total Downloads

Downloads (Last 12 months)58
Downloads (Last 6 weeks)13

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen YLin FZhang YZhou Y(2011)Loop-separable programs and their first-order definabilityArtificial Intelligence10.1016/j.artint.2010.12.001175:3-4(890-913)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.artint.2010.12.001
Zhang YZhou Y(2010)On the progression semantics and boundedness of answer set programsProceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031748.3031814(518-526)Online publication date: 9-May-2010
https://dl.acm.org/doi/10.5555/3031748.3031814
Cosmadakis SFoustoucos ESidiropoulos A(2010)Undecidability and intractability results concerning datalog programs and their persistency numbersACM Transactions on Computational Logic10.1145/1656242.165624711:2(1-29)Online publication date: 22-Jan-2010
https://dl.acm.org/doi/10.1145/1656242.1656247
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
https://dl.acm.org/doi/10.1007/s00236-006-0025-9
Dantsin EEiter TGottlob GVoronkov A(2001)Complexity and expressive power of logic programmingACM Computing Surveys10.1145/502807.50281033:3(374-425)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1145/502807.502810
Chaudhuri SVardi MVianu V(1994)On the complexity of equivalence between recursive and nonrecursive Datalog programsProceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/182591.182604(107-116)Online publication date: 24-May-1994
https://dl.acm.org/doi/10.1145/182591.182604
KANELLAKIS P(1990)Elements of Relational Database TheoryFormal Models and Semantics10.1016/B978-0-444-88074-1.50022-6(1073-1156)Online publication date: 1990
https://doi.org/10.1016/B978-0-444-88074-1.50022-6
Ajtai MGurevich Y(1989)Datalog vs. first-order logicProceedings of the 30th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1989.63469(142-147)Online publication date: 30-Oct-1989
https://dl.acm.org/doi/10.1109/SFCS.1989.63469

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents