(Enter summary)
Abstract: ing with credit is permitted.
To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work
in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications
Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or permissions@acm.org.
2 \Delta M. Benedikt, G. Dong, L. Libkin, L. Wong
The expressive power of first-order query languages with several classes of equality and ... (Update)
Context of citations to this paper: More
.... constraint databases are incapable of expressing many simple recursive queries like finding the transitive closure of an input graph [2]. Other query language proposals are based on fixpoint logic [1, 29] Unfortunately, the evaluation of fixpoint queries with linear...
.... have been proposed, including dense order constraints, linear arithmetic constraints and the most general polynomial constraints [GK96, BDLW98]. The fundamental relational query languages, relational algebra and calculus, and Datalog do not require that the relations be...
Cited by: More
Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1995)
(Correct)
Variable Independence in Constraint Databases - Chomicki, Goldin, Kuper, Toman (2002)
(Correct)
Definable Relations and First-Order Query Languages.. - Benedikt, Libkin..
(Correct)
Active bibliography (related documents): More All
0.6: On the Structure of Queries in Constraint Query Languages - Benedikt, Libkin (1996)
(Correct)
0.4: Relational Queries over Interpreted Structures - Benedikt, Libkin
(Correct)
0.4: Languages for Relational Databases over Interpreted Structures - Benedikt, Libkin (1997)
(Correct)
Similar documents based on text: More All
0.6: Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (1999)
(Correct)
0.5: Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)
(Correct)
0.5: Local Properties of Query Languages - Dong, Libkin, Wong (1997)
(Correct)
Related documents from co-citation: More All
59: Constraint Query Languages
- Kanellakis, Kuper et al. - 1990
45: Foundations of databases (context) - Abiteboul, Hull et al. - 1995
38: Towards a theory of spatial database queries (context) - Paredaens, Van den Bussche et al. - 1994
BibTeX entry: (Update)
M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. In manuscript, 1995. http://citeseer.ist.psu.edu/article/benedikt95relational.html More
@inproceedings{ benedikt96relational,
author = "Michael Benedikt and Guozhu Dong and Leonid Libkin and Limsoon Wong",
title = "Relational Expressive Power of Constraint Query Languages",
pages = "5--16",
year = "1996",
url = "citeseer.ist.psu.edu/article/benedikt95relational.html" }
Citations (may not include all citations):
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
294
Finite Model Theory (context) - Ebbinghaus, Flum - 1995
229
A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
227
North Holland (context) - Chang, Keisler - 1990
189
Computable queries for relational databases
- Chandra, Harel - 1980
163
Universality of data retrieval languages (context) - Aho, Ullman - 1979
116
On local and non-local properties (context) - Gaifman - 1982
87
Towards a theory of spatial database queries (context) - Paredaens, Van den Bussche et al. - 1994
83
Relational expressive power of constraint query languages
- Benedikt, Dong et al. - 1996
81
Probabilities on finite models (context) - Fagin - 1976
72
Finitely representable databases
- Grumbach, Su - 1994
48
Linear Orderings (context) - Rosenstein - 1982
46
Rothschild and J (context) - Graham - 1990
44
First-order queries on finite structures over the reals
- Paredaens, Van den Bussche et al. - 1995
40
Definable sets in ordered structures (context) - Pillay, Steinhorn - 1984
40
Definable sets in ordered structures (context) - Pillay, Steinhorn - 1988
31
Linear constraint databases (context) - Grumbach, Su et al. - 1994
30
Model completeness results for expansions of the ordered fie.. (context) - Wilkie - 1996
27
The elementary theory of restricted analytic fields with exp.. (context) - Van den Dries, Macintyre et al. - 1994
27
polynomial constraints in database query languages (context) - Afrati, Cosmadakis et al. - 1994
23
the structure of queries in constraint query languages
- Benedikt, Libkin - 1996
23
Domain independence and the relational calculus
- Hull, Su - 1994
21
Definable sets in ordered structures II (context) - Knight, Pillay et al. - 1986
21
Languages for relational databases over interpreted structur..
- Benedikt, Libkin - 1997
20
the expressive power of unary counters
- Benedikt, Keisler - 1997
17
the expressive power of the relational calculus with arithme.. (context) - Kuper - 1990
16
Constraint programming and database languages: A tutorial (context) - Kanellakis - 1995
16
First-order queries on databases embedded in an infinite str..
- Otto, Van den Bussche - 1996
14
First-order definability over constraint databases (context) - Grumbach, Su - 1995
13
order constraint queries over rational databases (context) - Stolboushkin, Taitslin - 1996
10
Several Complex Variables (context) - Narasimhan - 1971
9
a theory of database organization (context) - Hull, Yap et al. - 1984
9
The isomorphism property in nonstandard analysis and its use.. (context) - Henson - 1974
7
the expressiveness of first-order constraint languages
- Afrati, Andronikos et al. - 1995
5
The computational complexity of constraint query languages (context) - Revesz - 1995
5
DIMACS Technical Report (context) - Belegradek, Stolboushkin et al. - 1995
5
Model theory and exponentiation (context) - Marker - 1996
5
Alfred Tarski's elimination theory for real closed fields (context) - Van den Dries - 1988
3
Order minimality of the Gamma function (context) - Speissinger - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.bell-labs.com/cm/cs/who/libkin/publ.html): More
Direct Decompositions of Atomistic Algebraic Lattices - Libkin (1995)
(Correct)
Models of Approximation in Databases - Libkin
(Correct)
A Query Language for Multidimensional Arrays: Design.. - Libkin, Machlin, Wong (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC