625 search results - page 48 / 125 » Genetic algorithms for large join query optimization |
WWW
2008
ACM
14 years 8 months ago
2008
ACM
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
GIS
2005
ACM
14 years 8 months ago
2005
ACM
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
AAAI
1998
13 years 9 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...