147 search results - page 1 / 30 » Size Bounds and Query Plans for Relational Joins |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
PODS
1999
ACM
13 years 9 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
ICDE
2006
IEEE
13 years 11 months ago
2006
IEEE
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
Recent years witnessed an increasing interest in researches in XML, partly due to the fact that XML has now become the de facto standard for data interchange over the internet. A ...