Review - Computable Queries for Relational Data Bases.
Serge Abiteboul:
Review - Computable Queries for Relational Data Bases.
ACM SIGMOD Digital Review 1: (1999) BibTeX
Review
Chandra and Harel's papers in JCSS in 1980 and 1982 have been very influential. At that time, we had a very limited vision of query
languages. This was essentially coming from Codd's original papers. Codd implicitly put some limits to query languages, ``(Codd)
query completeness''. Since his work was mathematically founded, there was some reluctance to question it. The idea that one
could define classes of queries independently of any specific language was somewhat new. By pushing this, Chandra and Harel
opened the ground for a large body of works on expressivity and complexity. Some of the techniques they introduced turned out to be
applicable to a large variety of contexts.
Copyright © 1999 by the author(s).
Review published with permission.
References
- [1]
- Ashok K. Chandra, David Harel:
Computable Queries for Relational Data Bases.
J. Comput. Syst. Sci. 21(2): 156-178(1980) BibTeX
- [2]
- Ashok K. Chandra, David Harel:
Structure and Complexity of Relational Queries.
J. Comput. Syst. Sci. 25(1): 99-128(1982) BibTeX
BibTeX
Digital Review - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Digital Review: Copyright © by ACM (info@acm.org),
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:57:22 2009
