Sciweavers

589 search results - page 46 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IPSN
2009
Springer
15 years 4 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
15 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
WSDM
2012
ACM
236views Data Mining» more  WSDM 2012»
13 years 5 months ago
Effective query formulation with multiple information sources
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
Michael Bendersky, Donald Metzler, W. Bruce Croft
CIKM
2009
Springer
15 years 4 months ago
ASIC: algebra-based structural index comparison
Structural indices play a significant role in improving the efficiency of XML query evaluation. Being able to compare various structural indexing techniques is critical for a DBM...
Yuqing Wu, Sofia Brenes, Tejas Totade, Shijin Josh...