Sciweavers

297 search results - page 25 / 60
» On the Decidability of Consistent Query Answering
Sort
View
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
14 years 25 days ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
DLOG
2004
13 years 10 months ago
Extended Query Facilities for Racer and an Application to Software-Engineering Problems
er reports on a pragmatic query language for Racer. The abstract syntax and semantics of this query language is defined. Next, the practical relevance of this query language is sh...
Volker Haarslev, Ralf Möller, Ragnhild Van De...
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 3 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
DEBU
2010
108views more  DEBU 2010»
13 years 8 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
FQAS
2004
Springer
103views Database» more  FQAS 2004»
14 years 1 months ago
A Unifying Framework for Flexible Information Access in Taxonomy-Based Sources
A taxonomy-based source consists of a taxonomy and a database storing objects that are indexed in terms of the taxonomy. For this kind of sources, we describe a flexible interacti...
Yannis Tzitzikas, Carlo Meghini, Nicolas Spyratos