Sciweavers

320 search results - page 15 / 64
» A Theory of Spatio-Temporal Database Queries
Sort
View
ADC
2004
Springer
87views Database» more  ADC 2004»
14 years 28 days ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
ICFEM
2009
Springer
14 years 2 months ago
Symbolic Query Exploration
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 7 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
COLING
2000
13 years 9 months ago
Querying Temporal Databases Using Controlled Natural Language
Recent years have shown a surge in interest in temporal database systems, which allow users to store time-dependent intbrmation. We present a novel controlled natural language int...
Rani Nelken, Nissim Francez