Ashok Chandra, David Harel  Home/Search
Context Related
| wisdom.weizmann.ac...putableQueries.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~dharel/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is to settle the question of maximal expressiveness of query languages. This is done in two steps. First, the set of computable queries is defined. These correspond to partial recursive functions which satisfy a consistency criterion reflecting the fact that the computation is on a data base rather than, say, on a natural number (Update)
Cited by: More
Toward Logic Tailored for Computational Complexity - Yuri Gurevich Computer (1984) (Correct)
Model Checking - Clarke, Schlingloff (2000) (Correct)
Querying Relational Databases with RDQL - de Laborda, Conrad (2005) (Correct)
Active bibliography (related documents): More All
0.2: Mixed Transitivity For Functional And Multivalued Dependencies In .. - Zaniolo (Correct)
0.2: On the Construction of Persistent Programming Environments - Dearle (1988) (Correct)
0.2: Semantic Data Modelling for databases: Issues of.. - Trujillo, King, Palomar (1997) (Correct)
Similar documents based on text: More All
0.1: A Universal Model For Non-Procedural Database Languages - Naphtali Rishe.. (Correct)
0.1: Probabilistic Counting Algorithms for Data Base Applications - Flajolet, Martin (1985) (Correct)
0.1: Domain-Independent Queries on Databases with External Functions - Suciu (1995) (Correct)
Related documents from co-citation: More All
42: The complexity of relational query languages (context) - Vardi - 1982
37: Structure and complexity of relational queries - Chandra, Harel - 1982
36: Relational queries computable in polynomial time - Immerman - 1986
BibTeX entry: (Update)
A.K. Chandra and D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences 21, pp. 156-178, (1980). http://citeseer.ist.psu.edu/chandra80computable.html More
@article{ chandra80computable,
author = "Ashok K. Chandra and David Harel",
title = "Computable Queries for Relational Data Bases",
journal = "Journal of Computer and System Sciences",
volume = "21",
number = "2",
pages = "156-178",
year = "1980",
url = "citeseer.ist.psu.edu/chandra80computable.html" }
Citations (may not include all citations):198 Structure and complexity of relational queries - CHANDRA, HARL - 1980 DBLP
163 Universality of data retrieval languages (context) - AHO, ULLMAN - 1979 ACM
134 Formal Languages and their Relation to Automata (context) - HOPCROFT, ULLMAN - 1969
108 Relational completeness of data base sublanguages (context) - CODD - 1972
59 Dependency structures of data base relationships (context) - ARMSTRONG - 1974 DBLP
49 Equivalences among relational expressions (context) - AHO, SAOV et al. - 1978 DBLP
32 Programming primitives for database languages (context) - CHANDRA - 1981 ACM DBLP
21 The theory of joins in relational data bases (context) - AHO, BR et al. - 1977
19 the completeness of query languages for relational data base.. (context) - BANCILHON - 1978
18 the expressive power of the relational algebra (context) - PARDANS - 1978
9 Query-by-Example: Operations on the Transitive Closure (context) - ZLOOF - 1976
5 Computable nondeterministic functions (context) - CHANDRA - 1979 DBLP
4 A Relational Model for Large Shared Data Bases (context) - CODD - 1970
1 Optimal implementation of conjunctive queries in relational .. (context) - CHAND, MImLIN - 1977 ACM DBLP
1 Recursion in Retrieval Languages (context) - ArD, WNSLOW - 1979
1 Algorithmic properties of structures (context) - ENCLR - 1967 ACM DBLP
1 the power of features in programming (context) - CHANDRA, MANNA - 1975
1 Multivalued dependencies and a new normal form for relationa.. (context) - FACIN - 1977 ACM DBLP
1 Theory of Program Structures: Schemes, Semantics, Verificati.. (context) - GR - 1975
1 A complete axiomatization for functional and multivalued dep.. (context) - BmRh, FAON et al. - 1977 ACM DBLP
1 Query By Example, Program Description/Operations Manual (context) - SH - 1978
1 Semantics of probabilistic programs (context) - Kozy - 1979 DBLP
1 Finite algorithmic procedures and inductive definability (context) - MOLDESTAD, STOLTENBERG-HANSEN et al. - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~dharel/SCANNED.PAPERS/): More
Propositional Dynamic Logic of Nonregular Programs - Harel, Pnueli, Stavi (1983) (Correct)
Statecharts: A Visual Formalism For Complex Systems - Harel (1987) (Correct)
Beauty is in the Genes of the Beholder - Harel, Unger, Sussman (1984) (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