Database theory: query languages

Authors:
Nicole Schweikardt;Thomas Schwentick;Luc Segoufin
Affiliations:
Goethe-Universität Frankfurt am Main;Technische Universität Dortmund;INRIA and ENS Cachan
Venue:
Algorithms and theory of computation handbook
Year:
2010

Citing 84
Cited 1

A zero-one law for logic with a fixed-point operator

Information and Control
Relational queries computable in polynomial time

Information and Control
Decidability and expressiveness aspects of logic queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Optimizing datalog programs

Foundations of deductive databases and logic programming
Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressibility and parallel complexity

SIAM Journal on Computing
The alternating fixpoint of logic programs with negation

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Elements of relational database theory

Handbook of theoretical computer science (vol. B)
Building an object-oriented database system: the story of 02

Building an object-oriented database system: the story of 02
Optimization of real conjunctive queries

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Infinitary logics and 0–1 laws

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Query languages for hierarchic databases

Information and Computation
Undecidable optimization problems for database logic programs

Journal of the ACM (JACM)
Computing with first-order logic

Selected papers of the 23rd annual ACM symposium on Theory of computing
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Principles of programming with complex objects and collection types

ICDT '92 Selected papers of the fourth international conference on Database theory
Containment of conjunctive queries: beyond relations as sets

ACM Transactions on Database Systems (TODS)
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Normal forms and conservative extension properties for query languages over collection types

Journal of Computer and System Sciences
The complexity of querying indefinite data about linearly ordered domains

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
On the completeness of object-creating database transformation languages

Journal of the ACM (JACM)
On the complexity of the containment problem for conjunctive queries with built-in predicates

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Object identity as a query language primitive

Journal of the ACM (JACM)
Designing OQL: allowing objects to be queried

Information Systems
Constraint query languages (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Possibilities and limitations of using flat operators in nested algebra expressions

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
On the complexity of database queries

Journal of Computer and System Sciences
Conjunctive query containment revisited

Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Logics with counting and local properties

ACM Transactions on Computational Logic (TOCL)
Constraint databases: a tutorial introduction

ACM SIGMOD Record
A relational model of data for large shared data banks

Communications of the ACM
The parameterized complexity of database queries

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking

ACM Transactions on Computational Logic (TOCL)
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Database Management Systems

Database Management Systems
Object Database Standard: ODMG-93

Object Database Standard: ODMG-93
Relative information capacity of simple relational database schemata

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
The power of languages for the manipulation of complex values

The VLDB Journal — The International Journal on Very Large Data Bases
Definability and Descriptive Complexity on Databases of Bounded Tree-Width

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Generalized Model-Checking Problems for First-Order Logic

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Expressive power of SQL

Theoretical Computer Science - Database theory
Fixed-Point Logics on Planar Graphs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The complexity of knowledge representation

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Arithmetic, first-order logic, and counting quantifiers

ACM Transactions on Computational Logic (TOCL)
The Semijoin Algebra and the Guarded Fragment

Journal of Logic, Language and Information
Query answering exploiting structural properties

ACM SIGMOD Record
Theory of Relational Databases

Theory of Relational Databases
The 8 requirements of real-time stream processing

ACM SIGMOD Record
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The containment problem for Real conjunctive queries with inequalities

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science
The complexity of homomorphism and constraint satisfaction problems seen from the other side

Journal of the ACM (JACM)
Deciding equivalences among conjunctive aggregate queries

Journal of the ACM (JACM)
Automata for XML---A survey

Journal of Computer and System Sciences
On the complexity of division and set joins in the relational algebra

Journal of Computer and System Sciences
Machine models and lower bounds for query processing

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locally Excluding a Minor

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic (TOCL)
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
The Quest for a Logic Capturing PTIME

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The Power of Counting Logics on Restricted Classes of Finite Structures

CSL '07/EACSL '07, Proceedings of the 21st international workshop and the 16th Annual Conference of the EACSL on Computer Science Logic
Linear delay enumeration and monadic second-order logic

Discrete Applied Mathematics
The comparative linguistics of knowledge representation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Constraint Databases

Constraint Databases
MSO queries on tree decomposable structures are computable with linear delay

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
PTIME queries revisited

ICDT'05 Proceedings of the 10th international conference on Database Theory
On acyclic conjunctive queries and constant delay enumeration

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Model theory makes formulas large

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

The fine classification of conjunctive queries and parameterized logarithmic space complexity

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This chapter gives an introduction to the theoretical foundations of query languages for relational databases. It thus addresses a significant part of database theory. Special emphasis is put on the expressive power of query languages and the computational complexity of their associated evaluation and static analysis problems.