Sciweavers

1611 search results - page 161 / 323
» Queries Independent of Updates
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Building efficient multi-threaded search nodes
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...
Carolina Bonacic, Carlos García, Mauricio M...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 5 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
15 years 11 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
SAGA
2007
Springer
15 years 4 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
IR
2008
14 years 10 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...