-
Multiple Set Matching and Pre-Filtering with Bloom Multifilters
Bloom filter is a space-efficient probabilistic data structure for check...
01/07/2019 ∙ by Francesco Concas, et al. ∙
0
∙
share
read it
-
Bloom Multifilters for Multiple Set Matching
Bloom filter is a space-efficient probabilistic data structure for check...
01/07/2019 ∙ by Francesco Concas, et al. ∙
0
∙
share
read it
-
Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint
A similarity join aims to find all similar pairs between two collections...
10/29/2018 ∙ by Pengfei Xu, et al. ∙
0
∙
share
read it
-
ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs
Single-source and top-k SimRank queries are two important types of simil...
09/20/2017 ∙ by Yu Liu, et al. ∙
0
∙
share
read it
