Sciweavers

20 search results - page 1 / 4
» An Empirical Comparison of Randomized Algorithms for Large J...
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
13 years 11 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
VLDB
2001
ACM
82views Database» more  VLDB 2001»
13 years 9 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 8 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
CLUSTER
2008
IEEE
13 years 11 months ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra