Skip to content
code from P. Bouros, N. Mamoulis: A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins. PVLDB 10(11): 1346-1357 (2017)
C++ Makefile
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
algorithms
containers
inputs
partitioning
scheduling
LICENSE.md
README.md
def.h
main.cpp
makefile

README.md

ijoin

Compute interval overlap joins

Panagiotis Bouros, Nikos Mamoulis: A Forward Scan based Plane Sweep Algorithm for Parallel Interval Joins. PVLDB 10(11): 1346-1357 (2017), http://www.vldb.org/pvldb/vol10/p1346-bouros.pdf

Usage

   $ ij [OPTION]... [FILE1] [FILE2]

Description

   Mandatory arguments

   -a
          join algorithm
   -s
          pre-sort input files; mandatory only for single-threaded processing
   -b
          number of buckets; default value is 1000; mandatory only for bgFS algorithm
   -h
          use hash-based partitioning for parallel processing
   -d
          use domain-based partitioning for parallel processing
   -t
          number of threads available; mandatory for parallel processing

   Other arguments

   -u
          loop unrolling enforced; by default is deactivated
   -g
          greedy scheduling activated; valid only with -d option
   -m
          mini-joins breakdown activated; valid only with -d option
   -v
          adaptive partitioning activated; valid only with -d option
   -?
          display this help message and exit

Examples

   Original forward scan-based plane sweep from BrinkhoffKS@SIGMOD96, single-threaded processing
          /ij -a FS -u -s FILE1 FILE2
   Optimized FS with grouping, hash-based parallel processing using 9 threads
          /ij -a gFS -u -h -t 9 FILE1 FILE2
   Optimized FS with grouping and bucket indexing (1000 buckets), domain-based parallel processing under mj+greedy/adaptive setup using 16 threads
          /ij -a bgFS -b 1000 -u -d -m -g -v -t 16 FILE1 FILE2
You can’t perform that action at this time.