Sciweavers

792 search results - page 69 / 159
» Computing Iceberg Queries Efficiently
Sort
View
NSDI
2004
14 years 11 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
DAMON
2006
Springer
15 years 1 months ago
Architecture-conscious hashing
Hashing is one of the fundamental techniques used to implement query processing operators such as grouping, aggregation and join. This paper studies the interaction between modern...
Marcin Zukowski, Sándor Héman, Peter...
CNL
2009
14 years 11 months ago
Controlled English Ontology-Based Data Access
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
Camilo Thorne, Diego Calvanese
CLOUDCOM
2010
Springer
14 years 8 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...
HPDC
2010
IEEE
14 years 11 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...