FreshJoin: An Efficient and Adaptive Algorithm for Set Containment Join
Abstract This paper revisits set containment join (SCJ) problem, which uses the subset relationship (i.e., $$\subseteq$$ ⊆ ) as condition to join set-valued attributes of two relations and has many fundamental applications in commercial and scientific fields. Existing in-memory algorithms for SCJ ar...
Main Authors: | Jizhou Luo, Wei Zhang, Shengfei Shi, Hong Gao, Jianzhong Li, Wei Wu, Shouxu Jiang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-11-01
|
Series: | Data Science and Engineering |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41019-019-00107-y |
Similar Items
-
Analisis Perbandingan Optimasi Query Nasted Join dan Hash Join pada MySQL Server
by: Melany Mustika Dewi, et al.
Published: (2017-06-01) -
Normalized Laplacian spectrum of some subdivision-joins and -joins of two regular graphs
by: Arpita Das, et al.
Published: (2018-12-01) -
Analisis Perbandingan Cartesian Product, Cross Join, Inner Join dan Outer Join dalam Si Akad
by: Fatkhur Rochman, et al.
Published: (2018-04-01) -
Joining with versatile joining elements formed by friction spinning
by: Christian Wischer, et al.
Published: (2021-06-01) -
Synthesis, Characterization, and Application of Nanothermites for Joining
by: Bohlouli Zanjani, Golnaz
Published: (2013)