Using Prefix-Trees for Efficiently Computing Set Joins

@inproceedings{Jampani2005UsingPF,
  title={Using Prefix-Trees for Efficiently Computing Set Joins},
  author={Ravi Jampani and Vikram Pudi},
  booktitle={DASFAA},
  year={2005}
}
Joins on set-valued attributes (set joins) have numerous database applications. In this paper we propose PRETTI (PREfix Tree based seT joIn) – a suite of set join algorithms for containment, overlap and equality join predicates. Our algorithms use prefix trees and inverted indices. These structures are constructed on-the-fly if they are not already precomputed. This feature makes our algorithms usable for relations without indices and when joining intermediate results during join queries with… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…