On the complexity of queries in the logical data model
DOI10.1016/0304-3975(93)90219-JzbMATH Open0798.68072OpenAlexW2155243135MaRDI QIDQ688665FDOQ688665
Authors: Gabriel M. Kuper, Moshe Y. Vardi 
Publication date: 6 November 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90219-j
Recommendations
- scientific article; zbMATH DE number 4064541
- Data complexity of query answering in description logics
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- Data complexity of query answering in expressive description logics via tableaux
- On the complexity of database queries
- The complexity of evaluating relational queries
- scientific article; zbMATH DE number 1405452
- The Complexity of Datalog on Linear Orders
- On the data complexity of consistent query answering
expressivenessdata complexityintegrity constraintscomplexity of query processingdatabase logicexpression complexityformat modellogical data modellogical query language
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)
Cites Work
- A relational model of data for large shared data banks
- Alternation
- The polynomial-time hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure and complexity of relational queries
- The Format Model
- On Database Logic
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories
Cited In (5)
This page was built for publication: On the complexity of queries in the logical data model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688665)
