Manolis Koubarakis  Home/Search
Context Related
| co.umist.ac.uk/pub/WWW...tcsitcdb.ps.Z di.uoa.gr/~manolis/pu...tcsitcdb.ps.gz 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: co.umist.ac.uk/~manolis/ (more) From: di.uoa.gr/~manolis/journals (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In previous work we have developed the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include indefinite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance of this abstract scheme: indefinite temporal constraint databases. Our results indicate that the... (Update)
Context of citations to this paper: More
.... be found in [13, 17, 18] Although a number of practical methods have been proposed for accessing and searching moving objects [19, 25, 26, 43, 48], they all require Omega Gamma n) I Os in the worst case, even if the query range is empty. Kollios et al. 23] proposed an...
.... This added generality may be useful in elds such as scheduling, management of temporal databases and natural language processing ([Koubarakis, 1997,Stergiou and Koubarakis, 1998] Proposed four progressively more ecient algorithms for solving the consistency problem for sets...
Cited by: More
Safe Datalog Queries with Linear Constraints - Revesz (1998) (Correct)
A Mini-course on Temporal Databases - Chomicki, Toman (Correct)
SAT-based Procedures for Temporal Reasoning - Armando, Castellini, Giunchiglia (1999) (Correct)
Similar documents (at the sentence level): More
29.4%: Foundations of Temporal Constraint Databases - Koubarakis (1994) (Correct)
17.4%: Databases and Temporal Constraints: Semantics and Complexity - Koubarakis (1995) (Correct)
16.1%: Complexity Results for First-Order Theories of Temporal.. - Koubarakis (1994) (Correct)
Active bibliography (related documents): More All
0.8: Tractable Query Answering in Indefinite Constraint Databases.. - Koubarakis (1999) (Correct)
0.6: Constraint Databases: A Survey - Revesz (1998) (Correct)
0.4: Foundations Of Temporal Query Languages - Toman (1995) (Correct)
Similar documents based on text: More All
0.3: Definite Relations over Constraint Languages - Hohfeld, Smolka (1988) (Correct)
0.2: Tractable Disjunctions of Linear Constraints - Koubarakis (1996) (Correct)
0.2: From Local to Global Consistency in Temporal Constraint Networks - Koubarakis (1995) (Correct)
Related documents from co-citation: More All
8: Temporal Constraint networks (context) - DECHTER, MEIRI et al. - 1991
8: Constraint Query Languages - Kanellakis, Kuper et al. - 1990
8: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
BibTeX entry: (Update)
Koubarakis, M. (1997). The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Theoretical Computer Science, 171(1):89-- 112. http://citeseer.ist.psu.edu/koubarakis97complexity.html More
@article{ koubarakis97complexity,
author = "Manolis Koubarakis",
title = "The complexity of query evaluation in indefinite temporal constraint databases",
journal = "Theoretical Computer Science",
volume = "171",
number = "1--2",
pages = "25--60",
year = "1997",
url = "citeseer.ist.psu.edu/koubarakis97complexity.html" }
Citations (may not include all citations):379 The Complexity of Relational Query Languages (context) - Vardi - 1982
370 A Mathematical Introduction to Logic (context) - Enderton - 1972
340 Temporal Constraint Networks (context) - Dechter, Meiri et al. - 1989
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1995
315 Constraint Query Languages - Kanellakis, Kuper et al. - 1990
291 Theoretical Computer Science (context) - Berman, of - 1980
291 Theoretical Computer Science (context) - Stockmeyer, Hierarchy - 1977
274 A Catalog of Complexity Classes (context) - Johnson - 1990
227 North Holland (context) - Chang, Keisler - 1973
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1982
101 Incomplete Information in Relational Databases (context) - Imielinski, Lipski - 1984
89 Temporal Query Languages: A Survey - Chomicki - 1994
87 Towards a theory of spatial database queries (context) - Paredaens, Van den Bussche et al. - 1994
86 Foundations of a Functional Approach to Knowledge Representa.. (context) - Levesque - 1984
77 Constructive Negation for Constraint Logic Programming (context) - Stuckey - 1991
72 Finitely representable databases - Grumbach, Su - 1994
71 Techniques for Automatic Verification of Real-Time Systems (context) - Alur - 1991
64 Constraint Programming and Database Query Languages - Kanellakis, Goldin - 1994
58 A Closed Form for Datalog Queries with Integer Order (context) - Revesz - 1990
57 A Logic Programming View of CLP - Maher - 1993
52 A Closed Form Evaluation for Datalog Queries with Integer - Revesz - 1993
51 Decidable theories (context) - Rabin - 1977
48 Super-exponential Complexity of Presburger Arithmetic - Fischer, Rabin - 1974
43 The Computational Complexity of Logical Theories (context) - Ferrante, Rackoff - 1979
41 the Representation and Querying of Sets of Possible Worlds - Abiteboul, Kanellakis et al. - 1991
40 Theory of Integer and Linear Programming (context) - Schrijver - 1986
33 The Complexity of Querying Indefinite Data About Linearly Or.. - van der Meyden - 1992
31 Linear constraint databases (context) - Grumbach, Su et al. - 1994
28 Representation and Querying in Temporal Databases: the Power.. - Koubarakis - 1993
27 Polynomial Constraints in Database Query Languages (context) - Afrati, Cosmadakis et al. - 1994
26 Datalog with Integer Periodicity Constraints - Toman, Chomicki et al. - 1994
25 On Integrity Constraints (context) - Reiter - 1988
25 Database Models for Infinite and Indefinite Temporal Informa.. - Koubarakis - 1994
24 Complexity Results for First-Order Theories of Temporal Cons.. - Koubarakis - 1994
24 Querying Logical Databases (context) - Vardi - 1986
23 A Decision Procedure for the First Order Theory of Real Addi.. (context) - Ferrante, Rackoff - 1975
21 Decision Procedures for Constraint Based Extensions of Datal.. (context) - Cox, McAloon - 1993
21 Decision Procedures for Constraint Based Extensions of Datal.. (context) - Cox, McAloon - 1990
16 Foundations of Temporal Constraint Databases - Koubarakis - 1994
14 On Semantic Issues Connected with Incomplete Information Dat.. (context) - Jr - 1979
13 Constraint Objects - Srivastava, Ramakrishnan et al. - 1994
12 On Time-Space Classes and their Relation to the Theory of Re.. - Bruss, Meyer - 1980
12 Special Volume on Knowledge Representation (context) - Dechter, Meiri et al. - 1991
11 An Efficient Decision Procedure for the Theory of Rational O.. (context) - Ferrante, Geiser - 1977
10 Presburger Arithmetic with Bounded Quantifier Alternation (context) - Reddy, Loveland - 1978
9 Real Addition and the Polynomial Time Hierarchy (context) - Sontag - 1985
9 Foundations of Indefinite Constraint Databases - Koubarakis - 1994
7 Deductive Databases with Incomplete Information - Dong, Lakshmanan - 1992
5 The Complexity of Presburger Arithmetic with Bounded Quantif.. (context) - Furer - 1982
2 Databases and Temporal Constraints: Semantics and Complexity - Koubarakis - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.co.umist.ac.uk/~manolis/): More
Complexity Results for First-Order Theories of Temporal.. - Koubarakis (1994) (Correct)
Databases and Temporal Constraints: Semantics and Complexity - Koubarakis (1995) (Correct)
From Local to Global Consistency in Temporal Constraint Networks - Koubarakis (1995) (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