625 search results - page 4 / 125 » Genetic algorithms for large join query optimization |
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
SIGMOD
2010
ACM
14 years 13 days ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...