Constraint query algebras

Constraints

Volumn 1, Issue 1-2, 1996, Pages 45-83

  Goldin, Dina Q ^a,b   Kanellakis, Paris C ^a  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; DATA STRUCTURES; LINEAR ALGEBRA; MATHEMATICAL PROGRAMMING; NONLINEAR EQUATIONS; OPTIMIZATION; POLYNOMIALS; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS;

CONSTRAINT CALCULI; CONSTRAINT QUERY ALGEBRA; LINEAR CONSTRAINT ALGEBRA; NONLINEAR CONSTRAINT ALGEBRA;

CONSTRAINT THEORY;

EID: 0030234643     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00143878     Document Type: Article

References (51)

1. Abiteboul, S., Hull, R., Vianu, V. (1994). Foundations of Databases. Addison-Wesley.
2. Agre, L. & Vitter, J.S. (1995). Optimal Interval Management in External Memory. Manuscript, November 1995.
3. Aho, A.V., Hopcroft, J.E. & Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co.
4. Aspvall, B. & Shiloach, Y. (1980). A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM J. Comput., 9:4:827-845.
5. Aylamazyan, A.K., Gilula, M.M., Stolboushkin, A.P. & Schwartz, G.F. (1986). Reduction of the Relational Model with Infinite Domain to the Case of Finite Domains. Proc. USSR Acad. of Science (Doklady), 286(2):308-311.
6. Bayer, R. & McCreight, E. (1972). Organization of Large Ordered Indexes. Acta Informatica, 1:173-189.
7. Borning, A.H. (1981). The Programming Language Aspects of ThingLab, A Constraint-Oriented Simulation Laboratory. ACM TOPLAS 3:4:353-387.
8. Brodsky, A., Jaffar, J. & Maher, M.J. (1993). Toward Practical Constraint Databases. Proc. 19th VLDB, 322-331.
9. Chandra, A.K. & Harel, D. (1982). Structure and Complexity of Relational Queries. J. Comp. System Sci., 25:99-128.
10. Chomicki, J., Goldin, D. & Kuper, G. (1996). Variable Independence and Aggregation Closure. Proc. 15th ACM PODS, 40-48.
11. Chomicki, J. & Imielinski, T. (1989). Relational Specifications of Infinite Query Answers. Proc. ACM SIGMOD, 174-183.
12. Codd, E.F. (1970). A Relational Model for Large Shared Data Banks. CACM, 13:6:377-387.
13. Colmerauer, A. (1990). An Introduction to Prolog III. CACM, 33:7:69-90.
14. Dechter, R. (1992). From Local to Global Consistency. Artificial Intelligence, 55:87-107.
15. Dechter, R., Meiri, I. & Pearl, J. (1991). Temporal Constraint Networks. Artificial Intelligence, 49:61-95.
16. Dincbas, M., Van Hentenryck, Simonis, P.H., Aggoun, A., Graf, T. & Berthier, F. (1988). The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, Tokyo.
17. Ferrante, J. & Geiser, J.R. (1977). An Efficient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4:227-233.
18. Freuder, E. (1978). Synthesizing Constraint Expressions. CACM, 21:11.
19. Freuder, E. (1982). A Sufficient Condition for Backtrack-free Search. CACM, 29:1.
20. Grumbach, S. & Su, J. (1995). Dense Order Constraint Databases. Proc. 14th ACM PODS, pp. 66-77.
21. Grumbach, S., Su, J. & Tollu, C. (1994). Linear Constraint Query Languages: Expressive Power and Complexity. Proc. Workshop on Finite Model Theory, Indiana.
22. Hochbaum, D.S. & Naor, J. (1994). Simple and Fast Algorithms for Linear and Integer Programs with Two Variables per Inequality. SIAM J. Comput., 23:6:1179-1192.
23. Jaffar, J. & Lassez, J.L. (1987). Constraint Logic Programming. Proc. 14th ACM POPL, 111-119.
24. Kanellakis, P.C. (1990). Elements of Relational Database Theory. Handbook of Theoretical Computer Science, Vol. B, chapter 17 (J. van Leeuwen editor), North-Holland.
25. Kanellakis, P.C. & Goldin, D.Q. (1994). Constraint Programming and Database Query Languages. Symposium on Theoretical Aspects of Computer Software, LNCS 789, pp. 96-120, Sendai, Japan.
26. Kanellakis, P.C., Kuper, G.M. & Revesz, P.Z. (1995). Constraint Query Languages. JCSS, vol. 51: 26-52.
27. Kanellakis, P.C., Ramaswamy, S., Vengroff, D.E. & Vitter, J.S. (1993). Indexing for Data Models with Constraints and Classes. Proc. 12th ACM PODS, 233-243. To appear in JCSS.
28. Klug, A. (1988). On Conjunctive Queries Containing Inequalities. JACM, 35:1:146-160.
29. Koubarakis, M. (1993). Foundations of Temporal Constraint Databases. PhD Thesis. Nat. Tech. Univ. of Athens and Imperial College.
30. Mackworth, A.K. (1977). Consistency in Networks of Relations. AI, 8:1.
31. Montanari, U. (1974). Networks of Constraints: Fundamental Properties and Application to Picture Processing. Information Science, 7.
32. Mumick, I.S., Finkelstein, S.J., Pirahesh, H. & Ramakrishnan, R. (1990). Magic Conditions. Proc. 9th ACM PODS, 314-330.
33. log n Algorithm for the Two-variable-per-constraint Linear Programming Satisfiability Problem. Technical Report AIM-319, Stanford University.
34. Paredaens, J., van den Bussche, J. & Van Gucht, D. (1995). First-order Queries on Finite Structures over the Reals. Proc. IEEE LICS.
35. Preparata, F.P. & Shamos, M.I. (1985). Computational Geometry: An Introduction. Springer-Verlag.
36. Ramakrishnan, R. (1988). Magic Templates: A Spellbinding Approach to Logic Programs. Proc. 5th International Conference on Logic Programming, 141-159.
37. Ramaswamy, S.& Subramanian, S. (1994). Path Caching: A Technique for Optimal External Searching. Proc. 13th ACM PODS, 14-25.
38. Renegar, J. (1992). On the Computational Complexity and Geometry of the First-order Theory of the Reals: Parts I-III. Journal of Symbolic Computation, 13:255-352.
39. Samet, H. (1990). The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading MA.
40. Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley and Sons.
41. Srivastava, D. & Ramakrishnan, R. (1992). Pushing Constraint Selections. Proc. 11th ACM PODS, 301-316.
42. Steele, G.L. (1980). The Definition and Implementation of a Computer Programming Language Based on Constraints. Ph.D. thesis, MIT, AI-TR 595.
43. Stuckey, P.J. & Sudarshan, S. (1994). Compiling Query Constraints. Proc. 13th ACM PODS, 56-68.
44. Sutherland, I.E. (1963). SKETCHPAD: A Man-Machine Graphical Communication System. Spartan Books.
45. Tarjan, A.E. (1981). A Unified Approach to Path Problems. JACM, 28:3:577-593.
46. Tarski, A. (1951). A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, California.
47. Ullman, J.D. (1982). Principles of Database Systems, 2nd edition. Computer Science Press.
48. Van Hentenryck, P. (1989). Constraint Satisfaction in Logic Programming. MIT Press.
49. Van Hentenryck, P., McAllester, D. & Kapur, D. (1995). Solving Polynomial Systems Using a Branch and Prune Approach. Brown CS Tech. Rep. CS-95-01. To appear in SIAM J. of Numerical Analysis.
50. Vardi, M.Y. (1982). The Complexity of Relational Query Languages. Proc. 14th ACM STOC, 137-146.
51. Yannakakis, M. (1988). Expressing Combinatorial Optimization Problems by Linear Programs. Proc. 20th ACM STOC, 223-228.