Sciweavers

1168 search results - page 41 / 234
» Optimization strategies for complex queries
Sort
View
PDP
2003
IEEE
14 years 3 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
WAIM
2004
Springer
14 years 3 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng
CIKM
2005
Springer
14 years 4 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 12 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 12 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch