Sciweavers

2987 search results - page 264 / 598
» Multiobjective Query Optimization
Sort
View
107
Voted
SIGMOD
2004
ACM
124views Database» more  SIGMOD 2004»
16 years 2 months ago
BLAS: An Efficient XPath Processing System
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
Yi Chen, Susan B. Davidson, Yifeng Zheng
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
15 years 8 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 6 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
151
Voted
AAAI
2011
14 years 2 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 9 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar