Efficient Main-Memory Algorithms for Set Containment Join Using Inverted Lists

We present two algorithms for set containment joins based on inverted lists. The first algorithm scans the left relation and determines for each tuple all the qualifying tuples by querying the inverted file for the right relation. The second algorithm employs the common inverted file for both relati...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Shaporenkov, Dmitry
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Cache Line Hash Table Inverted File Inverted List Main Memory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!