MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Safe constraint queries (1998) [28 citations — 8 self]

Download:
Download as a PDF | Download as a PS
by Michael A. Benedikt, Michael Benedikt, Leonid Libkin, Leonid Libkin
SIAM J. Comput
http://www.bell-labs.com/user/benedikt/papers/safety.cop.ps
Add To MetaCart

Abstract:

copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications

Citations

1461 Convex analysis – Rockafellar
1035 Foundations of Databases – Abiteboul, Hull, et al. - 1995
957 Principles of database and knowledge-base systems, volume 1 – Ullman - 1988
810 Geometric Algorithms and Combinatorial Optimization – Grotschel, Lovasz, et al. - 1993
420 Computational Geometry in C – O’Rourke - 1998
351 Information integration using logical views – Ullman - 1997
346 Constraint query languages – Kanellakis, Kuper, et al. - 1995
102 Equivalences among relational expressions with union and difference operators – Sagiv, Yannakakis - 1980
94 den Dries. Tame Topology and O-minimal Structures – van - 1998
90 Gucht. Towards a theory of spatial database queries – Paredaens, Bussche, et al.
79 Relational expressive power of constraint query languages – Benedikt, Dong, et al. - 1995
73 Definable sets in ordered structures – Pillay, Steinhorn - 1984
67 Safety and Translation of Relational Calculus Queries – Gelder, Topor - 1991
59 Finitely representable databases – Grumbach, Su
44 On the difficulty of triangulating three-dimensional nonconvex polyhedra – Ruppert, Seidel - 1992
44 Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function – Wilkie
40 Linear constraint databases – Grumbach, Su, et al. - 1994
40 Deciding containment for queries with complex objects – Levy, Suciu - 1997
33 Gucht. First-order queries on finite structures over the reals – Paredaens, Bussche, et al.
29 Languages for relational databases over interpreted structures – Benedikt, Libkin - 1997
28 On the structure of queries in constraint query languages – Benedikt, Libkin
24 Reduction of a relational model with infinite domains to the finite-domain case – Ailamazyan, Gilula, et al.
23 Safety of Recursive Horn Clauses with Infinite Relations – Ramakrishnan, Bancilhon, et al. - 1987
22 den Dries, Remarks on Tarski’s problem concerning – van - 1984
20 On Safety, Domain Independence, and Capturability of Database Queries – Kifer - 1988
19 Safety and translation of calculus queries with scalar functions – Escobar-Molano, Hull, et al. - 1993
19 Gucht, On the Desirability and Limitations of Linear Spatial Database Models – Vandeurzen, Gyssens, et al. - 1995
16 Linear vs. polynomial constraints in database query languages – Afrati, Cosmadakis, et al. - 1994
16 On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases – Dumortier, Gyssens, et al. - 1997
16 Safe Query Languages for Constraint Databases – Revesz - 1998
14 Finite queries do not have effective syntax – Stolboushkin, Taitslin - 1995
12 Model Theory of Fields – Marker, Messmer, et al. - 1996
10 An axiomatic approach to deciding query safety in deductive databases – Kifer, Ramakrishnan, et al. - 1988
9 On the containment and equivalence of database queries with linear constraints – Ibarra, Su - 1997
9 Gucht. An expressive language for linear spatial database queries – Vandeurzen, Gyssens, et al. - 1998
9 The decision problem for database dependencies – Vardi - 1981
8 Elementary set operations with d-dimensional polyhedra – Bieri, Nef - 1988
8 Domain independence and the relational calculus. Acta Informatica 31:513-524 – Hull, Su - 1994
6 On query languages for linear queries definable with polynomial constraints – Vandeurzen, Gyssens, et al. - 1996
5 Beiträge zur Theorie der – Nef - 1978
4 Combinatorial Topology – Aleksandrov - 1960
3 Safe stratified datalog with integer order does not have syntax – Stolboushkin, Taitslin - 1995
2 On first order database query languages – Avron, Hirshfeld - 1991
2 On the number of solutions of Diophantine equations – Davis - 1972
2 Tarski and Engeler encompassed – Euclid - 1998
1 vs. order constraint queries over rational databases – Linear