Sciweavers

126 search results - page 15 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
CSL
2003
Springer
14 years 23 days ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
SEBD
2007
113views Database» more  SEBD 2007»
13 years 9 months ago
Conditional Preferences: A New Semantics for Database Queries
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preference...
Paolo Ciaccia
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 7 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
DBPL
2009
Springer
144views Database» more  DBPL 2009»
14 years 2 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu