Constrained dependencies

Theoretical Computer Science

Volumn 173, Issue 1, 1997, Pages 113-149

  Maher, Michael J ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED DEPENDENCIES; CONSTRAINED FUNCTIONAL DEPENDENCIES; CONSTRAINT DOMAINS; FINITENESS DEPENDENCIES; IMPLICATION PROBLEM;

ALGORITHMS; DATABASE SYSTEMS; LOGIC PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

CONSTRAINT THEORY;

EID: 0031077049     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00193-4     Document Type: Article

References (42)

1. K.R. Apt and M. Gabbrielli, Declarative interpretations reconsidered, in: Proc. 11th Internat. Conf. on Logic Programming, 1994.
2. T. Armstrong, K. Marriott, P. Schachte and H. Søndergaard, Boolean functions for dependency analysis: algebraic properties and efficient representation, in: Proc. Static Analysis Symp., Lecture Notes in Computer Science, Vol. 724 (Springer, Berlin, 1994) 266-280.
3. R. Bagnara, A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages, manuscript, 1995.
4. M. Baudinet, J. Chomicki and P. Wolper, Constraint-generating dependencies, in: Proc. 5th Internat. Conf. on Database Theory, Lecture Notes in Computer Science, Vol. 893 (Springer, Berlin, 1995) 322-337.
5. C. Beeri and P.A. Bernstein, Computational problems related to the design of normal form relational schemas, ACM Trans. Database Systems 4 (1979) 30-59.
6. C. Braem, B. Le Charlier, S. Modart and P. Van Hentenryck, Cardinality analysis of prolog, in: Proc. Internat, Sympos. on Logic Programming (1994) 457-471.
7. U.S. Chakravarthy, J. Grant and J. Minker, Foundations of semantic query optimization for deductive databases, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988) 243-274.
8. M. Codish, D. Dams and E. Yardeni, Bottom-up abstract interpretation of logic programs, Theoret. Comput. Sci. 124 (1994) 93-125.
9. P. Dart, On derived dependencies and connected databases, J. Logic Programming 11 (1991) 163-188.
10. P. De Bra and J. Paredaens, Horizontal decomposition for handling exceptions to functional dependencies, in: H. Gallaire, J. Minker and J.M. Nicolas, eds., Advances in Database Theory II (Plenum Press, New York, 1984) 123-141.
11. S.K. Debray and R. Ramakrishnan, Abstract interpretation of logic programs using magic transformations, J. Logic Programming 18 (1994) 149-176.
12. S.K. Debray and D.S. Warren, Functional computations in logic programs, ACM Trans. Programming Languages Systems 11 (1989) 451-481.
13. C. Elkan, A decision procedure for conjunctive query disjointness, in: Proc. 8th ACM Symp. on Principles of Database Systems (1989) 134-139.
14. C. Elkan, Independence of logical database queries and updates, in: Proc. 9th ACM Symp. on Principles of Database Systems (1990) 154-160.
15. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi, A new declarative semantics for logic languages, in: Proc. 5th Internat. Conf. and Symp. on Logic Programming, 1988.
16. M. Gabbrielli and G. Levi, Modeling answer constraints in constraint logic programs, in: Proc. 8th ICLP (1991) 238-252.
17. H. Gao and D.S. Warren, A powerful evaluation strategy for CLP programs, in: Proc. Workshop on Principles and Practice of Constraint Programming (1993) 92-99.
18. J. Jaffar and J.-L. Lassez, Constraint logic programming, in: Proc. 14th ACM Symp. on Principles of Programming Languages, Munich (1987) 111-119.
19. J. Jaffar and M.J. Maher, Constraint logic programming: a survey, J. Logic Programming 19 & 20, (1994) 503-581.
20. P. Kanellakis, Elements of relational database theory, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (North-Holland, Amsterdam, 1990) 1073-1156.
21. P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, J. Comput. System Sci., to appear. Preliminary version appeared in Proc. 9th ACM Symp. on Principles of Database Systems (1990) 299-313.
22. P. Kanellakis, G. Kuper and P. Revesz, Constraint query languages, J. Comput. System Sci., to appear. Preliminary version appeared in Proc. 9th ACM Symp. on Principles of Database Systems (1990) 299-313.
23. D. Kemp and P. Stuckey, Analysis based constraint query optimization, in: Proc. 10th Internat. Conf. on Logic Programming (1993) 666-682.
24. A. Klug, Calculating constraints on relational expressions, ACM Trans. Database Systems 5 (1980) 260-290.
25. J.-L. Lassez and K. McAloon, A constraint sequent calculus, in: Proc. Symp. on Logic in Computer Science (1990) 52-62.
26. J.-L. Lassez and K. McAloon, A canonical form for generalized linear constraints, J. Symbolic Comput., 1992.
27. M.J. Maher, A logic programming view of CLP, in: Proc. 10th Internat. Conf. on Logic Programming (MIT Press, New York, 1993) 737-753.
28. M.J. Maher and R. Ramakrishnan, Déjà Vu in fixpoints of logic programs, in: Proc. North American Conf. on Logic Programming, Cleveland (1989) 963-980.
29. M.J. Maher and R. Ramakrishnan, Déjà Vu in fixpoints of logic programs, manuscript, 1994 (a fuller version of [27]).
30. M. Maher and D. Srivastava, Chasing constrained tuple-generating dependencies, in: Proc. 15th ACM Symp. on Principles of Database Systems, 1996.
31. K. Marriott and H. Sondergaard, Notes for a tutorial on abstract interpretation of logic programs, distributed at NACLP, 1989.
32. R. van der Meyden, The complexity of querying indefinite data about linearly ordered domains, in: Proc. 11th ACM Symp. on Principles of Database Systems (1992) 331-345.
33. J. Paredaens, P. De Bra, M. Gyssens and D. Van Gucht, The Structure of the Relational Database Model, EATCS Monographs on Theoretical Computer Science, Vol. 17 (Springer, Berlin, 1989).
34. R. Ramakrishnan, personal communication, 1993.
35. R. Ramakrishnan, F. Bancilhon and A. Silberschatz, Safety of recursive Horn clauses with infinite relations, in: Proc. 6th ACM Symp. on Principles of Database Systems (1987) 328-339.
36. K. Sagonas, T. Swift and D.S. Warren, XSB as an efficient deductive database engine, SIGMOD Record, 1994.
37. D. Srivastava, Subsumption and indexing in constraint query languages with linear arithmetic constraints, Ann. Math. Artifi. Intell. 8 (1993) 315-343.
38. M. Vardi, Fundamentals of dependency theory, IBM Research Report RJ4858, 1985.
39. X.S. Wang, C. Bettini, A. Brodsky and S. Jajodia, Logical design for temporal databases with multiple granularities, manuscript, 1995.
40. X. Zhang and Z.M. Ozsoyoglu, On efficient reasoning with implication constraints, Proc. Conf. on Deductive and Object-Oriented Databases, Lecture Notes in Computer Science, Vol. 760 (Springer, Berlin, 1993) 236-252.
41. X. Zhang and Z.M. Ozsoyoglu, Some results on the containment and minimization of (in)equality queries, Inform. Processing Lett. 50 (1994) 259-267.
42. W. Ziarko, The discovery, analysis and representation of data dependencies in databases, in: G. Piatetsky-Shapiro and W. Frawley, eds., Knowledge Discovery in Databases (AAAI Press, New York, 1991).