163 citations found. Retrieving documents...
A.V. Aho and J.D. Ullman, "
Universality of Data Retrieval Languages
", Proc. of 6th ACM Symposium on Principles of Programming Languages, 1979, 110-117.
Home/Search
Document Not in Database
Context
Related Articles
Check
This paper is cited by the following papers:
First 50 documents
Next 50
The ADAMS Database Language - John Pfaltz James (1989)
(1 citation)
(Correct)
Language Constructs for Programming Active Databases - Richard Hull And (1991)
(22 citations)
(Correct)
Expressive Power and Data Complexity of Nonrecursive - Query Languages For
(Correct)
Expressive Power of SQL - Libkin (2001)
(2 citations)
(Correct)
Game Representations of Complexity Classes - McColm (2001)
(Correct)
Structure and Complexity of Relational Queries - Chandra, Harel (1982)
(193 citations)
(Correct)
Computable Queries for Relational Databases - Chandra, Harel (1980)
(184 citations)
(Correct)
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997)
(Correct)
The Generalized Counting Method For Recursive Logic Queries - Sacca, Zaniolo (1988)
(15 citations)
(Correct)
The Generalized Counting Method for Recursive Logic Queries - Saccà, Zaniolo
(Correct)
Tractable Inference Relations - Givan, McAllester
(Correct)
On the Computation of Relational View Complements - Lechtenbörger, Vossen (2001)
(Correct)
Space Usage in Functional Query Languages - Abiteboul, Hillebrand (1995)
(8 citations)
(Correct)
Architectural Considerations for Extending a Relational.. - Dobrovnik, Mittermeir (1992)
(Correct)
General Transitive Closures and Aggregate Functions - Eder (1991)
(Correct)
Logic and Databases - Eder
(Correct)
First-Order Queries on Finite Structures Over the Reals - Paredaens, Van den.. (1995)
(40 citations)
(Correct)
First-Order Queries on Databases Embedded in an Infinite.. - Otto, Van den Bussche (1995)
(15 citations)
(Correct)
Applications of Alfred Tarski's Ideas in Database Theory - Van den Bussche (2001)
(3 citations)
(Correct)
Finite-Model Theory - A Personal Perspective - Fagin (1993)
(42 citations)
(Correct)
On the Expressive Power of Datalog: Tools and a Case Study - Kolaitis, Vardi (1990)
(37 citations)
(Correct)
Implementation of The Nested Relational Algebra in Java - Hao (1997)
(2 citations)
(Correct)
Non-Deterministic Aspects of Object-Creating Database.. - Van den Bussche
(Correct)
Expressiveness and Complexity of Generic Graph Machines - Gemis, Peelman..
(Correct)
A Semi-Deterministic Approach to Object Creation and.. - van den Bussche, van.. (1993)
(1 citation)
(Correct)
On the Completeness of Object-Creating Database.. - Van den Bussche..
(3 citations)
(Correct)
Polynomially Orderable Classes of Structures - Van Den Bussche, Van Gucht
(Correct)
Evaluation and Optimization of Complex Object Selections - Van den Bussche (1991)
(Correct)
GraphLog: a Visual Formalism for Real Life Recursion - Consens (1990)
(83 citations)
(Correct)
Finite Models And Finitely Many Variables - Dawar (1999)
(1 citation)
(Correct)
Abduction from Logic Programs: Semantics and Complexity - Eiter, Gottlob, Leone (1998)
(14 citations)
(Correct)
Expressive Power of SQL - Libkin (2001)
(2 citations)
(Correct)
Fixpoint Logics, Relational Machines, and Computational.. - Abiteboul, Vardi, Vianu (1993)
(2 citations)
(Correct)
Finitely Representable Databases (Extended Abstract) - Grumbach, al.
(Correct)
Logics for Databases and Information Systems - Chomicki, (eds.) (1998)
(15 citations)
(Correct)
Toward Logic Tailored for Computational Complexity - Yuri Gurevich Computer (1984)
(59 citations)
(Correct)
Relational Programming with CrocoPat - Beyer (2006)
(Correct)
Efficient Relational Calculation for Software Analysis - Beyer, Noack, Lewerentz (2005)
(Correct)
On Impossibility of Decremental Recomputation of Recursive.. - Dong, Libkin, Wong (1995)
(5 citations)
(Correct)
Incremental Recomputation of Recursive Queries with Nested.. - Libkin, Wong (1997)
(3 citations)
(Correct)
Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1995)
(54 citations)
(Correct)
at most N . Thus, P is at most p - Since There Exists
(Correct)
Fixed Point vs.First-Order Logic on Finite Ordered.. - Kfoury, Wymann-Böni (1993)
(Correct)
A Characterization of First-Order Definable Subsets on.. - Kfoury, Wymann-Böni (1993)
(Correct)
Expressiveness and Complexity of - Concurrent Constraint Programming
(Correct)
Infinitary Logics and 0-1 Laws - Kolaitis, Vardi (1992)
(5 citations)
(Correct)
A Data Warehouse for Cross-Species Anatomy - Wagner (2002)
(Correct)
On the Expressive Power of the Object Constraint Language OCL - Mandel, Cengarle (1999)
(7 citations)
(Correct)
On the Computation of Relational View Complements - Lechtenbörger, Vossen (2003)
(Correct)
The LDL System Prototype - Chimenti, Gamboa, Krishnamurthy.. (1990)
(33 citations)
(Correct)
First 50 documents
Next 50
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