Sciweavers

350 search results - page 14 / 70
» An optimization framework for map-reduce queries
Sort
View
180
Voted
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
16 years 17 days ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
114
Voted
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
16 years 17 days ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
SIGMOD
1994
ACM
99views Database» more  SIGMOD 1994»
15 years 4 months ago
Optimizing Queries on Files
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Mariano P. Consens, Tova Milo
91
Voted
CIKM
2009
Springer
15 years 7 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
126
Voted
ICDE
2010
IEEE
194views Database» more  ICDE 2010»
15 years 7 months ago
Visualizing cost-based XQuery optimization
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
Andreas M. Weiner, Theo Härder, Renato Olivei...