Dong Deng, Chengcheng Yang, Shuo Shang, Fan Zhu,
Description: Dong Deng, Chengcheng Yang, Shuo Shang, Fan Zhu, Li Liu, Ling Shao LCJoin: Set Containment Join via List Crosscutting Inception Institute of Artificial Intelligence Contents Problem Definition Set Containment Join Job Advertisements Job
Related Topics
Download Presentation
"Dong Deng, Chengcheng Yang, Shuo Shang, Fan Zhu," is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
slide1. Dong Deng, Chengcheng Yang, Shuo Shang,
Fan Zhu, Li Liu, Ling Shao LCJoin: Set Containment Join via List Crosscutting Inception Institute of Artificial Intelligence<br>
slide2. Contents<br>
slide3. Problem Definition Set Containment Join Job Advertisements
Job Seeker Publish/Subscribe<br>
slide4. Existing Solutions Set Containment Join (SCJ) SCJ Basic Idea<br>
slide5. Motivation Existing Solutions Union-Oriented Methods Enumerate & Lookup Signature Size? Large Signature Size High Enumeration Cost Small Signature Size Many Candidates. High Verification Cost<br>
slide6. Existing Solutions Intersection-Oriented Methods Build Inverted Index Verification Free<br>
slide7. LCJoin List Cross-Cutting Based Set Containment Join Rip-Cutting Cross-Cutting GAP GAP GAP<br>
slide8. LCJoin List Cross-Cutting Based Set Containment Join Example MaxSid<br>
slide9. LCJoin List Cross-Cutting Based Set Containment Join Early Termination MaxSid<br>
slide10. LCJoin List Cross-Cutting Based Set Containment Join Two Optimizations<br>
slide11. LCJoin Prefix-Tree Based Method PostOrder-Traverse root use the max NextMax on the path from root to leaf as the next MaxSid<br>
slide12. SAL-Hashing LCJoin Data Partition Build Local Inverted Index Shorter Inverted Lists<br>
slide13. SAL-Hashing LCJoin Data Partition Build Local Inverted Index Cost Benefit Shorter Inverted List for Each Node on This Partition Build Local Inverted Index Use Original Built Inverted Index<br>
slide14. Experimental Results Experimental Setup Ubuntu 16.04 Intel Xeon Gold-6148 Processor 64G DRAM Characteristics of Our Datasets<br>
slide15. Experimental Results Evaluation of the tree-based methods FLICKR AOL TWITTER<br>
slide16. Experimental Results Evaluation of data partition methods AOL Dynamic Partition achieved the best performance AOL TWITTER<br>
slide17. Experimental Results Comparing with State-of-the-Art AOL TWITTER<br>
slide18. Conclusion LCJoin A cross-cutting based list intersection method, which can skip many irrelevant entries. Data partitions to further improve the efficiency and scalability. Experimenting to demonstrate the superiority of LCJoin<br>
slide19. Q&A<br>
Fan Zhu, Li Liu, Ling Shao LCJoin: Set Containment Join via List Crosscutting Inception Institute of Artificial Intelligence<br>
slide2. Contents<br>
slide3. Problem Definition Set Containment Join Job Advertisements
Job Seeker Publish/Subscribe<br>
slide4. Existing Solutions Set Containment Join (SCJ) SCJ Basic Idea<br>
slide5. Motivation Existing Solutions Union-Oriented Methods Enumerate & Lookup Signature Size? Large Signature Size High Enumeration Cost Small Signature Size Many Candidates. High Verification Cost<br>
slide6. Existing Solutions Intersection-Oriented Methods Build Inverted Index Verification Free<br>
slide7. LCJoin List Cross-Cutting Based Set Containment Join Rip-Cutting Cross-Cutting GAP GAP GAP<br>
slide8. LCJoin List Cross-Cutting Based Set Containment Join Example MaxSid<br>
slide9. LCJoin List Cross-Cutting Based Set Containment Join Early Termination MaxSid<br>
slide10. LCJoin List Cross-Cutting Based Set Containment Join Two Optimizations<br>
slide11. LCJoin Prefix-Tree Based Method PostOrder-Traverse root use the max NextMax on the path from root to leaf as the next MaxSid<br>
slide12. SAL-Hashing LCJoin Data Partition Build Local Inverted Index Shorter Inverted Lists<br>
slide13. SAL-Hashing LCJoin Data Partition Build Local Inverted Index Cost Benefit Shorter Inverted List for Each Node on This Partition Build Local Inverted Index Use Original Built Inverted Index<br>
slide14. Experimental Results Experimental Setup Ubuntu 16.04 Intel Xeon Gold-6148 Processor 64G DRAM Characteristics of Our Datasets<br>
slide15. Experimental Results Evaluation of the tree-based methods FLICKR AOL TWITTER<br>
slide16. Experimental Results Evaluation of data partition methods AOL Dynamic Partition achieved the best performance AOL TWITTER<br>
slide17. Experimental Results Comparing with State-of-the-Art AOL TWITTER<br>
slide18. Conclusion LCJoin A cross-cutting based list intersection method, which can skip many irrelevant entries. Data partitions to further improve the efficiency and scalability. Experimenting to demonstrate the superiority of LCJoin<br>
slide19. Q&A<br>