Sciweavers

3341 search results - page 147 / 669
» On Bounded Queries and Approximation
Sort
View
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
14 years 8 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
PODS
1992
ACM
100views Database» more  PODS 1992»
15 years 2 months ago
On the Equivalence of Recursive and Nonrecursive Datalog Programs
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...
Surajit Chaudhuri, Moshe Y. Vardi
DIS
1998
Springer
15 years 2 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 1 months ago
Query Phrase Suggestion from Topically Tagged Session Logs
Searchers' difficulty in formulating effective queries for their information needs is well known. Analysis of search session logs shows that users often pose short, vague quer...
Eric C. Jensen, Steven M. Beitzel, Abdur Chowdhury...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 3 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...