116 search results - page 10 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
158
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
199
Voted
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
97
Voted
SSDBM
2003
IEEE
15 years 5 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
108
Voted
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
206
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...