708 search results - page 76 / 142 » A Genetic Algorithm for Database Query Optimization |
SIGMOD
1999
ACM
14 years 1 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....
GEOINFO
2003
13 years 10 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
ICDE
2012
IEEE
11 years 11 months ago
2012
IEEE
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
VLDB
1998
ACM
14 years 1 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
In Online Analytic Processing (OLAP) deployments, different users, lines of businesses and business units often create adhoc aggregation hierarchies tailor-made for specific report...