1991
DOI: 10.1145/119995.115835
|View full text |Cite
|
Sign up to set email alerts
|

On the propagation of errors in the size of join results

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
86
0

Year Published

1997
1997
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 80 publications
(91 citation statements)
references
References 4 publications
4
86
0
Order By: Relevance
“…The results prove the accuracy of the formula, the relative error being 8% for binary joins and 38% for queries of four inputs. These numbers are comparable with previous work on selectivity of spatial selections [31] or joins [32], as well as, with error propagation experiments in the context of relational queries [13]. The proposed models are essential for the optimization of queries that involve several spatial logical operators, possibly in addition to some non-spatial ones.…”
Section: Discussionsupporting
confidence: 81%
See 1 more Smart Citation
“…The results prove the accuracy of the formula, the relative error being 8% for binary joins and 38% for queries of four inputs. These numbers are comparable with previous work on selectivity of spatial selections [31] or joins [32], as well as, with error propagation experiments in the context of relational queries [13]. The proposed models are essential for the optimization of queries that involve several spatial logical operators, possibly in addition to some non-spatial ones.…”
Section: Discussionsupporting
confidence: 81%
“…than the input data. However, this is an unavoidable problem, which also exists in query optimization of relational queries involving many operators [13].…”
Section: Experimental Evaluationmentioning
confidence: 99%
“…After several years of inactivity on the topic of histograms, interest in it was renewed in the context of studying how initial errors in statistics maintained by the database propagate in estimates of the size of complex query results [36]. In particular, it was shown that, under some rather general conditions, in the worst case, errors propagate exponentially in the query size (i.e., in the number of joins), removing any hope for high-quality estimates for large multi-join queries.…”
Section: Optimal Sort Parametermentioning
confidence: 99%
“…They outperform naïve query processing (NaiveQP) with a factor 450 and attribute statistics profiling without grouping (AttrSP) with a factor 50. This demonstrates that the grouped strategies GroupSP and 2PhaseSP alleviate the problem of errors in the cost estimates [12] by measuring real execution time and selectivity for each group. The difference between GroupSP and 2PhaseSP is insignificant (Fig.…”
Section: Resultsmentioning
confidence: 80%