Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Journal of Computer and System Sciences
On the representation and querying of sets of possible worlds
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Reasoning about partially ordered events
Artificial Intelligence
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database models for infinite and indefinite temporal information
Information Systems
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
On the computational complexity of querying bounds on differences constraints
Artificial Intelligence
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
From local to global consistency in temporal constraint networks
Theoretical Computer Science - Special issue: principles and practice of constraint programming
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Constraint query algebras
Principles of multimedia database systems
Principles of multimedia database systems
The DEDALE system for complex spatial queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A constrant-based spatial extension to SQL
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Querying temporal constraint networks in PTIME
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Problem of Incomplete Information in Relational Databases
Problem of Incomplete Information in Relational Databases
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
A Closed Form for Datalog Queries with Integer Order
ICDT '90 Proceedings of the Third International Conference on Database Theory
Spatial Databases, The Final Frontier
ICDT '95 Proceedings of the 5th International Conference on Database Theory
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Foundations of Indefinite Constraint Databases
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Manipulating Spatial Data in Constraint Databases
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Databases and Temporal Constraints: Semantics and Complexity
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
From Local to Global Consistency in Temporal Constraint Networks
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient Querying of Periodic Spatiotemporal Objects
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Deductive and inductive reasoning on spatio-temporal data
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Hi-index | 0.00 |
We consider the scheme of indefinite constraint databases proposed by Koubarakis. This scheme can be used to represent indefinite information arising in temporal, spatial and truly spatiotemporal applications. The main technical problem that we address in this paper is the discovery of tractable classes of databases and queries in this scheme. We start with the assumption that we have a class of constraints C with satisfiability and variable elimination problems that can be solved in PTIME. Under this assumption, we show that there are several general classes of databases and queries for which query evaluation can be done with PTIME data complexity. We then search for tractable instances of C in the area of temporal and spatial constraints. Classes of constraints with tractable satisfiability problems can be easily found in the literature. The largest class that we consider is the class of Horn disjunctive linear constraints over the rationals. Because variable elimination for Horn disjunctive linear constraints cannot be done in PTIME, we try to discover subclasses with tractable variable elimination problems. The class of UTVPI≠ constraints is the largest class that we show to have this property. Finally, we restate the initial general results with C ranging over the newly discovered tractable classes. Tractable query answering problems for indefinite temporal and spatial constraint databases are identified in this way.