query languages for lists and trees (Extended  Home/Search
Context
Related
| logic.pdmi.ras.ru/~dantsin/ps...DV00.ps 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: logic.pdmi.ras.ru/~dants...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Evgeny Dantsin St.Petersburg Institute of Mathematics and dantsin@cs.man.ac.uk Andrei Voronkov voronkov@cs.man.ac.uk ABSTRACT We extend the traditional query languages by primitives for handling lists and trees. Our main results characterize the expressive power and data complexity of the following extended languages: (1) relational algebra with lists and trees, (2) nonrecursive Datalog with lists and trees, (3) nonrecursive Prolog with lists and trees, (4) rst-order logic over... (Update)
Similar documents (at the sentence level):
11.0%: Expressive Power and Data Complexity of Nonrecursive Logic.. - Dantsin, Voronkov (1998) (Correct)
Active bibliography (related documents): More All
0.1: Relational Queries over Interpreted Structures - Benedikt, Libkin (Correct)
0.1: Complexity of Nonrecursive Logic Programs with Complex Values - Vorobyov, Voronkov (1998) (Correct)
0.1: Exact and Approximate Aggregation in Constraint Query Languages - Benedikt, Libkin (1998) (Correct)
Similar documents based on text: More All
0.6: Complexity of Query Answering in Logic Databases with Complex .. - Dantsin, Voronkov (1998) (Correct)
0.6: Bag and Set Unification - Dantsin, Voronkov (Correct)
0.4: Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1999) (Correct)
BibTeX entry: (Update)
@misc{ for-expressive,
author = "Query Languages For",
title = "Expressive Power and Data Complexity of Nonrecursive",
url = "citeseer.ist.psu.edu/594937.html" }
Citations (may not include all citations):775 Foundation of Databases (context) - Abiteboul, Hull et al. - 1995
291 Theoretical Computer Science (context) - Berman, of - 1980
198 Structure and complexity of relational queries - Chandra, Harel - 1982
192 Logic programming (context) - Apt - 1990
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
133 Cambridge University Press (context) - Hodges - 1993
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
116 On local and nonlocal properties (context) - Gaifman - 1982
75 Complexity and expressive power of logic programming - Dantsin, Eiter et al. - 1999
43 The computational complexity of logical theories (context) - Ferrante, Racko - 1979
26 A uniform method for proving lower bounds on the computation.. (context) - Compton, Henson - 1990
23 Safe constraint queries - Benedikt, Libkin - 1998
21 Languages for relational databases over interpreted structur.. - Benedikt, Libkin - 1997
20 A query language for list-based complex objects - Colby, Robertson et al. - 1994
1 ur Mathematical Logic und Grundlagen der Mathematik (context) - Fagin, spectra - 1975
1 The expressiveness of locally strati ed programs (context) - Blair, Marek et al. - 1995
1 Algebraic and calculus query (context) - Hull, Su
Documents on the same site (http://logic.pdmi.ras.ru/~dantsin/papers.html): More
Approximation algorithms for MAX SAT: A better.. - Dantsin.. (1998) (Correct)
MAX-SAT approximation beyond the limits of.. - Dantsin.. (1998) (Correct)
A deterministic (2-2/(k+1))^n algorithm for k-SAT.. - Dantsin, Goerdt.. (2001) (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