Sciweavers

1238 search results - page 35 / 248
» View-based query containment
Sort
View
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
14 years 9 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein
99
Voted
FOCS
1998
IEEE
15 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
63
Voted
COLING
2010
14 years 4 months ago
Corpus-based Semantic Class Mining: Distributional vs. Pattern-Based Approaches
Main approaches to corpus-based semantic class mining include distributional similarity (DS) and pattern-based (PB). In this paper, we perform an empirical comparison of them, bas...
Shuming Shi, Huibin Zhang, Xiaojie Yuan, Ji-Rong W...
SAT
2004
Springer
101views Hardware» more  SAT 2004»
15 years 3 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
90
Voted
MM
2009
ACM
199views Multimedia» more  MM 2009»
15 years 4 months ago
Visual query suggestion
Query suggestion is an effective approach to improve the usability of image search. Most existing search engines are able to automatically suggest a list of textual query terms b...
Zheng-Jun Zha, Linjun Yang, Tao Mei, Meng Wang, Ze...