Abstract
The goal of this paper is to provide a strong interaction between constraint programming and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra (RA) and SQL, by adding constraint solving capabilities to them. In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems. Non-determinism is introduced by means of a guessing operator, which declares a set of relations to have an arbitrary extension. This new operator results in languages with higher expressive power, able to express all problems in the complexity class NP. Some syntactical restrictions which make data complexity polynomial are shown. The effectiveness of both languages is demonstrated by means of several examples.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley Publ. Co., Reading, Massachussetts, 1995.
J. Beasley, M. Krishnamoorthy, Y. Sharaiha, and D. Abramson. Scheduling aircraft landings-the static case. Transportation Science, 34:180–197, 2000.
M. Cadoli and L. Palopoli. Circumscribing datalog: expressive power and complexity. Theor. Comp. Sci., 193:215–244, 1998.
M. Cadoli and A. Schaerf. Compiling problem specifications into SAT. In Proceedings of the European Symposium On Programming (ESOP 2001), volume 2028 of LNAI, pages 387–401. Springer-Verlag, 2001.
R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, ed., Complexity of Computation, pages 43–74. AMS, 1974.
R. Fourer, D. M. Gay, and B. W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing, 1993.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, Ca, 1979.
G. Gottlob, P. Kolatis, and T. Schwentick. Existential second-order logic over graphs: Charting the tractability frontier. In Proc. of FOCS 2000. IEEE CS Press, 2000.
P. G. Kolaitis and C. H. Papadimitriou. Why not negation by fixpoint? J. of Computer and System Sciences, 43:125–144, 1991.
C. H. Papadimitriou. Computational Complexity. Addison Wesley, Reading, MA, 1994.
R. Ramakrishnan. Database Management Systems. McGraw-Hill, 1997.
P. Van Hentenryck. The OPL Optimization Programming Language. The MITPress, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cadoli, M., Mancini, T. (2002). Combining Relational Algebra, SQL, and Constraint Programming. In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-45988-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43381-1
Online ISBN: 978-3-540-45988-0
eBook Packages: Springer Book Archive