Constraint-generating dependencies

Journal of Computer and System Sciences

Volumn 59, Issue 1, 1999, Pages 94-115

  Baudinet, Marianne ^a   Chomicki, Jan ^b   Wolper, Pierre ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b MONMOUTH UNIVERSITY   (United States)

^c UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECISION THEORY; INFORMATION MANAGEMENT;

CONSTRAINT GENERATING DEPENDENCIES; DEPENDENCY THEORY;

COMPUTATION THEORY;

EID: 0033169436     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1632     Document Type: Article

References (44)

1. Aspvall B., Plass M., Tarjan R. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Process. Lett. 8:1979;121-123.
2. M. Baudinet, Temporal logic programming is complete and expressive, in Sixteenth Association for Computing Machinery Symposium on Principles of Programming Languages, Austin, Texas, January 1989, pp. 267-280.
3. Baudinet M. On the expressiveness of temporal logic programming. Inform. and Comput. 117:1995;157-180.
4. Baudinet M., Chomicki J., Wolper P. Temporal deductive databases. Tansel A., Clifford J., Gadia S., Jajodia S., Segev A., Snodgrass R. Temporal Databases. Theory, Design, and Implementation. 1993;294-320 Benjamin-Cummings, Redwood City.
5. M. Baudinet, M. Niézette, and P. Wolper, On the representation of infinite temporal data and queries, in Tenth Association for Computing Machinery Symposium on Principles of Database Systems, Denver, Colorado, May 1991, pp. 280-290,.
6. Beeri C., Vardi M. A proof procedure for data dependencies. J. Assoc. Comput. Mach. 31:1984;718-741.
7. Benedikt M., Dong G., Libkin L., Wong L. Relational expressive power of constraint query languages. J. Assoc. Comput. Mach. 45:1998;1-34.
8. Brodsky A., Jaffar J., Maher M. J. Towards practical constraint databases. Constraints. 2:1997;279-304.
9. A. Brodsky, C. Lassez, and, J.-L. Lassez, Separability of polyhedra for optimal filtering of spatial and constraint data, in, Fourteenth Association for Computing Machinery Symposium on Principles of Databases Systems, San Jose, California, May 1995.
10. J. Chomicki, Polynomial time query processing in temporal deductive databases, in Ninth Association for Computing Machinery on Principles of Database Systems, Nashville, Tennessee, April 1990, pp. 379-391.
11. J. Chomicki and T. Imieliński, Temporal deductive databases and infinite objects, in Seventh Association for Computing Machinery Symposium on Principles of Database Systems, Austin, Texas, March 1988, pp. 61-73.
12. Chomicki J., Imieliński T. Finite representation of infinite query answers. ACM Trans. Database Systems. 18:1993;181-223.
13. Cox J., McAloon K. Decision procedures for constraint based extensions of Datalog. Benhamou F., Colmerauer A. Constraint Logic Programming: Selected Research. 1993;MIT Press, Cambridge.
14. Garey M. R., Johnson D. S. Computer and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
15. Ginsburg S., Hull R. Order dependency in the relational model. Theoret. Comput. Sci. 26:1983;149-195.
16. Ginsburg S., Hull R. Sort sets in the relational model. J. Assoc. Comput. Mach. 33:1986;465-488.
17. S. Grumbach and J. Su, First-order definability over constraint databases, in Principles and Practice of Constraint Programming, First International Conference, CP'95, Cassis, France, September 1995, Lecture Notes in Computer Science, Vol. 976, pp. 121-136, Springer-Verlag, Berlin/New York.
18. Grumbach S., Su J. Finitely, Representable databases. J. Comput. System Sci. 55:1997;273-298.
19. Grumbach S., Su J. Queries with arithmetical constraints. Theor. Comput. Sci. 173:1997;151-181.
20. Guo S., Sun W., Weiss M. A. Solving satisfiability and implication problems in database systems. ACM Trans. Database Systems. 21:1996;270-293.
21. A. Gupta, Y. Sagiv, J. D. Ullman, and J. Widom, Constraint checking with partial information, in Thirteenth Association for Computing Machinery Symposium on Principles of Database Systems, Minneapolis, Minnesota, May 1994, pp. 45-55.
22. N. S. Ishakbeyoglu and Z. M. Oszoyoglu, On the maintenance of implication integrity constraints, in Fourth International Conference on Database and Expert Systems Applications, Prague, September 1993, Lecture Notes in Computer Science, Vol. 720, pp. 221-232, Springer-Verlag, Berlin/New York.
23. Jensen C., Snodgrass R. Temporal specialization and generalization. IEEE Trans. Knowledge Data Engineering. 6:1994;954-974.
24. Kabanza F., Stévenne J.-M., Wolper P. Handling infinite temporal data. J. Comput. System Sci. 51:1995;3-17.
25. Kannellakis P., Kuper G., Revesz P. Constraint query languages. J. Comput. System Sci. 51:1995;26-52.
26. P. C. Kanellakis, S. Ramaswamy, D. E. Vengroff, and J. S. Vitter, Indexing for data models with constraints and classes, in Twelfth Association for Computing Machinery Symposium on Principles of Database Systems, Washigton, DC, May 1993, pp. 233-243.
27. M. Koubarakis, Complexity results for first-order theories of temporal constraints, in Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR'94), May 1994, pp. 379-390.
28. Koubarakis M. Database models for infinite and indefinite temporal information. Inform. Systems. 19:1994;141-174.
29. Koubarakis M. The complexity of query evaluation in indefinite temporal constraint databases. Theoret. Comput. Sci. 171:1997;25-60.
30. Maher M. J. Constrained dependencies. Theor. Comput. Sci. 173:1997;113-149.
31. M. J. Maher, and, D. Srivastava, Chasing constrained tuple-generating dependencies, in, Fifteenth Association for Computing Machinery Symposium on Principle of Database Systems, Montreal, Canada, June 1996, ACM Press.
32. Maier D. The Theory of Relational Databases. 1983;Comput. Sci. Press, New York.
33. Revesz P. Z. A closed-form evaluation for datalog queries with integer (gap)-order constraints. Theor. Comput. Sci. 116:1993;117-149.
34. Rosenkrantz D., Hunt H. B. I. Processing conjunctive predicates and queries. International Conference on Very Large Data Bases. 1980;. p. 64-72.
35. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.
36. Srivastava D. Subsumption and indexing in constraint query languages with linear arithmetic constraints. Ann. Math. and Artificial Intelligence. 1993.
37. A. P. Stolboushkin and M. A. Taitslin, Linear vs. order constraint queries over rational databases, in Fifteenth Association for Computing Symposium on Principle of Database Systems, Montreal, Canada, June 1996, pp. 17-27, ACM Press.
38. Sun W., Weiss M. A. An efficient algorithm for testing implication involving arithmetic inequalities. IEEE Trans. Knowledge and Data Eng. 6:1994;997-1001.
39. Thalheim B. Dependencies in relational databases. Teubner-Texte Math. 1991;Teubner, Stuttgart.
40. Toman D., Chomicki J. Datalog with integer periodicity constraints. J. Logic Programming. 35:1998;263-290.
41. Toman D. Memoing evaluation for constraint extensions of datalog. Constraints. 2:1998;337-359.
42. Ullman J. D. Principles of Database and Knowledge-Base Systems. Volume II: The New Technologies. 1989;Comput. Sci. Press, New York.
43. van der Meyden R. The complexity of querying indefinite data about linearly ordered domains. J. Comput. System Sci. 54:1997;113-135.
44. X. Zhang, and, Z. M. Ozsoyoglu, On efficient reasoning with implication constraints, in, Third International Conference on Deductive and Object-Oriented Databases, Phoenix, Arizona, December 1993.