Depth estimation for ranking query optimization

@article{Schnaitter2007DepthEF,
  title={Depth estimation for ranking query optimization},
  author={Karl Schnaitter and Joshua Spiegel and Neoklis Polyzotis},
  journal={The VLDB Journal},
  year={2007},
  volume={18},
  pages={521-542}
}
A relational ranking query uses a scoring function to limit the results of a conventional query to a small number of the most relevant answers. The increasing popularity of this query paradigm has led to the introduction of specialized rank join operators that integrate the selection of top tuples with join processing. These operators access just “enough” of the input in order to generate just “enough” output and can offer significant speed-ups for query evaluation. The number of input tuples… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
29 Citations
25 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Depth estimation for ranking query optimization

  • Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis
  • Technical report UCSC-CRL-07-02, UC Santa Cruz,
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…