Tractable query answering in indefinite constraint databases: Basic results and applications to querying spatiotemporal information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1678, Issue , 1999, Pages 204-223

  Koubarakis, Manolis ^a   Skiadopoulos, Spiros ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; FORMAL LOGIC; MANAGEMENT INFORMATION SYSTEMS; QUERY PROCESSING;

CONSTRAINT DATABASES; INDEFINITE INFORMATION; QUERY-ANSWERING PROBLEMS; SATISFIABILITY PROBLEMS; SPATIO-TEMPORAL APPLICATIONS; SPATIOTEMPORAL INFORMATION; TEMPORAL AND SPATIAL CONSTRAINTS; VARIABLE ELIMINATION;

C (PROGRAMMING LANGUAGE);

EID: 84957020055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48344-6_12     Document Type: Conference Paper

References (50)

1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the Representation and Querying of Sets of Possible Worlds. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 34-48, 1987. 205.
2. J. F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26(11):832-843, November 1983. 218.
3. P. Balbiani, J.-F. Condotta, and L. F. del Cerro. Bidimensional Temporal Relations. In Proceedings of KR’98, June 1998. 218.
4. E. Bertino, A. Belussi, and B. Catania. Manipulating Spatial Data in Constraint Databases. In M. Scholl and A. Voisard, editors, Proc. of the Fifth Int. Symp. on Spatial Databases, number 1262 in Lecture Notes in Computer Science, pages 115-140, Berlin, Germany, July 1997. Springer Verlag, Berlin. 205, 211.
5. V. Brusoni, L. Console, and P. Terenziani. On the computational complexity of querying bounds on differences constraints. Artificial Intelligence, 74(2):367-379, 1995. 206, 212, 219.
6. A. Chandra and D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99-128, 1982. 212.
7. T. Dean and M. Boddy. Reasoning About Partially Ordered Events. Artificial Intelligence, 36:375-399, 1988. 220.
8. R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. In R. Brachman, H. Levesque, and R. Reiter, editors, Proceedings of 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 83-93, Toronto, Ontario, 1989. 217.
9. D. Q. Goldin. Constraint Query Algebras. PhD thesis, Dept. of Computer Science, Brown University, 1997. 217, 218.
10. D. Q. Goldin and P. Kanellakis. Constraint Query Algebras. Constraints, 1(1):45-83, 1997. 217, 218.
11. G. Grahne. The Problem of Incomplete Information in Relational Databases. Technical Report Report A-1989-1, Department of Computer Science, University of Helsinki, Finland, 1989. Also published as Lecture Notes in Computer Science 554, Springer Verlag, 1991. 205, 208.
12. S. Grumbach, P. Rigaux, and L. Segoufin. The DEDALE system for complex spatial queries. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 213-224, 1998. 205, 211.
13. S. Grumbach and J. Su. Finitely representable databases. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 289-300, 1994. 205.
14. S. Grumbach, J. Su, and C. Tollu. Linear constraint databases. In D. Leivant, editor, Proceedings of the Logic and Computational Complexity Workshop, Indianapolis, 1994. Springer Verlag. To appear in LNCS. 205.
15. H.-W. Guesgen. Spatial reasoning based on Allen’s temporal logic. Technical Report TR-89-094, ICSI, 1989. 218.
16. R. H. Gueting, M. H. Bohlen, M. Erwing, C. S. Jensen, N. A. Lorentzos, M. Schneider, and M. Vazirgiannis. A Foundation for Representing and Querying Moving Objects. Technical Report 238-9, Informatik, FernUniversitat, 1998. 205, 211.
17. W. Harvey and P. Stuckey. A unit two variable per inequality integer constraint solver for constraint logic programming. In Proceedings of Australian Computer Science Conference (Australian Computer Science Communications), pages 102-111, 1997. 217.
18. D. S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal of Computing, 23(6):1179-1192, 1994. 218.
19. T. Imielinski and W. Lipski. Incomplete Information in Relational Databases. Journal of ACM, 31(4):761-791, 1984. 207, 208.
20. Joxan Jaffar, Michael J. Maher, Peter Stuckey, and Ronald Yap. Beyond Finite Domains. In A. Borning, editor, Proceedings of PPCP’94, volume 874 of Lecture Notes in Computer Science, pages 86-94. Springer Verlag, 1994. 217.
21. Jonsson, P. and Bäckström, C. A Linear Programming Approach to Temporal Reasoning. In Proceedings of AAAI-96, 1996. 205, 216.
22. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint Query Languages. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 299-313, 1990. 205, 208, 211, 212.
23. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, 51:26-52, 1995. 207, 217.
24. M. Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, 19(2):141-173, March 1994. 205.
25. M. Koubarakis. Foundations of Indefinite Constraint Databases. In A. Borning, editor, Proceedings of the 2nd International Workshop on the Principles and Practice of Constraint Programming (PPCP’94), volume 874 of Lecture Notes in Computer Science, pages 266-280. Springer Verlag, 1994. 205, 208, 210, 211.
26. M. Koubarakis. Foundations of Temporal Constraint Databases. PhD thesis, Computer Science Division, Dept. of Electrical and Computer Engineering, National Technical University of Athens, February 1994. Available electronically from http://www.co.umist.ac.uk/˜manolis. 205, 212.
27. M. Koubarakis. Databases and Temporal Constraints: Semantics and Complexity. In J. Clifford and A. Tuzhilin, editors, Recent Advances in Temporal Databases (Proceedings of the International Workshop on Temporal Databases, Zürich, Switzerland, September 1995), Workshops in Computing, pages 93-109. Springer, 1995. 210, 211.
28. M. Koubarakis. From Local to Global Consistency in Temporal Constraint Networks. In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP’95), volume 976 of LNCS, pages 53-69, Cassis, France, September 1995. 206, 217.
29. M. Koubarakis. Tractable Disjunctions of Linear Constraints. In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP’96), Boston, MA, August 1996. 297-307. 205, 216, 217.
30. M. Koubarakis. From Local to Global Consistency in Temporal Constraint Networks. Theoretical Computer Science, 173:89-112, February 1997. Invited submission to the special issue dedicated to the 1st International Conference on Principles and Practice of Constraint Programming (CP95), Editors: U. Montanari and F. Rossi. 206, 217.
31. M. Koubarakis. The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Theoretical Computer Science, 171:25-60, January 1997. Special Issue on Uncertainty in Databases and Deductive Systems, Editor: L. V. S. Lakshmanan. 205, 206, 207, 208, 210, 211, 212.
32. M. Koubarakis and S. Skiadopoulos. Querying Temporal Constraint Networks in PTIME. In Proceedings of AAAI-99, 1999. Forthcoming. 206.
33. G. M. Kuper, S. Ramaswamy, K. Shim, and J. Su. A Constrint-Based Spatial Extension to SQL. In Proceedings of ACM-GIS98, pages 112-117, 1998. 205.
34. R. Laurini and D. Thompson. Fundamentals of Spatial Information Systems. Academic Press, 1992. 205.
35. Bernhard Nebel and Hans-Jürgen Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM, 42(1):43-66, January 1995. 218.
36. D. Papadias, Y. Theodoridis, T. Sellis, and M. Egenhofer. Topological Relations in theWorld of Minimum Bounding Rectangles: A Study with R-trees. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 92-103, 1995. 218.
37. J. Paredaens. Spatial Databases: the Final Frontier. In Proceedings of ICDT-95, pages 14-32, 1995. 205.
38. P. Z. Revesz. A Closed Form for Datalog Queries with Integer Order. In Proceedings of the 3rd International Conference on Database Theory, pages 187-201, 1990. 212.
39. Robert Shostak. Deciding Linear Inequalities by Computing Loop Residues. Journal of the ACM, 28(4):769-779, 1981. 218.
40. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and Querying Moving Objects. In Proceedings of ICDE-97, 1997. 205, 209, 211.
41. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Querying the uncertain position of moving objects. In Temporal Databases: Research and Practice, volume 1399, pages 310-337. Springer Verlag, 1998. 209, 211.
42. V. S. Subrahmanian. Principles of Multimedia Database Systems. Morgan Kaufmann, 1998. 205.
43. Peter van Beek. Temporal Query Processing with Indefinite Information. Artificial Intelligence in Medicine, 3:325-339, 1991. 206, 212, 219.
44. Peter van Beek and Robin Cohen. Exact and Approximate Reasoning about Temporal Relations. Computational Intelligence, 6:132-144, 1990. 218.
45. R. van der Meyden. The Complexity of Querying Indefinite Data About Linearly Ordered Domains (Preliminary Version). In Proceedings of the 11th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, pages 331-345, 1992. Full version appears in JCSS, 54(1), pp. 113-135, 1997. 212, 219, 220.
46. M. Vardi. The Complexity of Relational Query Languages. In Proceedings of ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 137-146, 1982. 212.
47. M. Vardi. Querying Logical Databases. Journal of Computer and System Sciences, 33:142-160, 1986. 205.
48. Marc Vilain and Henry Kautz. Constraint Propagation Algorithms for Temporal Reasoning. In Proceedings of AAAI-86, pages 377-382, 1986. 219.
49. Marc Vilain, Henry Kautz, and Peter van Beek. Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report. In D. S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 373-381. Morgan Kaufmann, 1989. 219.
50. M. Yannakakis. Expressing Combinatorial Optimization Problems by Linear Programs. In Proc. of ACM Symposium on the Theory of Computing, pages 223-288, 1988. 216.