Using Prefix-Trees for Efficiently Computing Set Joins

  title={Using Prefix-Trees for Efficiently Computing Set Joins},
  author={Ravi Jampani and Vikram Pudi},
  • Ravi Jampani, Vikram Pudi
  • Published in DASFAA 2005
  • Computer Science
  • 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

    Figures, Tables, and Topics from this paper.

    PIEJoin: Towards Parallel Set Containment Joins
    Efficient and scalable trie-based algorithms for computing set containment relations
    LCJoin: Set Containment Join via List Crosscutting
    TT-Join: Efficient Set Containment Join
    Set containment join revisited
    Set containment joins using two prefix trees ( Exposé )


    Publications referenced by this paper.