Sciweavers

9414 search results - page 238 / 1883
» Adaptive Query Processing
Sort
View
VLDB
1999
ACM
127views Database» more  VLDB 1999»
15 years 7 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
99
Voted
SIGIR
2002
ACM
15 years 3 months ago
Using part-of-speech patterns to reduce query ambiguity
Query ambiguity is a generally recognized problem, particularly in Web environments where queries are commonly only one or two words in length. In this study, we explore one techn...
James Allan, Hema Raghavan
ITCC
2002
IEEE
15 years 8 months ago
Taxonomy-based Adaptive Web Search Method
Current crawler-based search engines usually return a long list of search results containing a lot of noise documents. By indexing collected documents on topic path in taxonomy, t...
Said Mirza Pahlevi, Hiroyuki Kitagawa
127
Voted
CN
1998
118views more  CN 1998»
15 years 3 months ago
Adaptive web caching: towards a new global caching architecture
An adaptive, highly scalable, and robust web caching system is needed to effectively handle the exponential growth and extreme dynamic environment of the World Wide Web. Our work ...
B. Scott Michel, Khoi Nguyen, Adam Rosenstein, Lix...
DOLAP
2009
ACM
15 years 10 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis