See this document in CiteSeerX!

Expressive Power of SQL (2001)  (Make Corrections)  (3 citations)
Leonid Libkin
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
toronto.edu/~libkin/pape...icdt01.ps.gz
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  toronto.edu/~libkin/publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . It is a folk result in database theory that SQL cannot express recursive queries such as reachability; in fact, a new construct was added to SQL3 to overcome this limitation. However, the evidence for this claim is usually given in the form of a reference to a proof that relational algebra cannot express such queries. SQL, on the other hand, in all its implementations has three features that fundamentally distinguish it from relational algebra: namely, grouping, arithmetic operations,... (Update)

Similar documents based on text:   More   All
2.0:   Expressive Power of SQL - Libkin (2001)   (Correct)
0.2:   A New Look At Linguistic Importance Weighted Aggregations - Carlsson, Fullér   (Correct)
0.1:   Logics Capturing Local Properties - Libkin (2001)   (Correct)

BibTeX entry:   (Update)

Libkin L.: Expressive Power of SQL. Proc. 8th Int. Conf. on Database Theory (ICDT): 1-21, 2001. http://citeseer.ist.psu.edu/407307.html   More

@article{ libkin01expressive,
    author = "Leonid Libkin",
    title = "Expressive Power of {SQL}",
    journal = "Lecture Notes in Computer Science",
    volume = "1973",
    pages = "1--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/407307.html" }
Citations (may not include all citations):
775   Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
163   Universality of data retrieval languages (context) - Aho, Ullman
116   On uniformity within NC - Barrington, Immerman et al. - 1990
116   On local and non-local properties (context) - Gaifman - 1982
110   Descriptive Complexity (context) - Immerman - 1998
106   A Guide to the SQL Standard (context) - Date, Darwen - 1997
106   Equivalence of relational algebra and relational calculus qu.. (context) - Klug - 1982
94   Mathematical Structures in Computer Science (context) - Wadler - 1992
93   Principles of programming with complex objects and collectio.. - Buneman, Naqvi et al. - 1995
61   Natural proofs - Razborov, Rudich - 1997
54   Low complexity aggregation in GraphLog and Datalog - Consens, Mendelzon - 1993
54   and logarithmic space (context) - Etessami, successor - 1997
49   Local properties of query languages - Dong, Libkin et al. - 2000
49   Query languages for bags and aggregate functions - Libkin, Wong - 1997
49   Model-theoretic methods in the study of elementary logic (context) - Hanf - 1965

[Article contains additional citations not shown here]

Documents on the same site (http://www.cs.toronto.edu/~libkin/publ.html):   More
Logics Capturing Local Properties - Libkin (2001)   (Correct)
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)   (Correct)
Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (1999)   (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