On Spark, Apriori with a Trie or Hash Table Trie runs several times faster than with a Hash Tree, and the two Trie variants perform nearly identically.
https://hadoop.apache.org/docs/current/hadoop -project-dist/hadoop- hdfs/HdfsDesign.html
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Data Structure Perspective to the RDD-based Apriori Algorithm on Spark
On Spark, Apriori with a Trie or Hash Table Trie runs several times faster than with a Hash Tree, and the two Trie variants perform nearly identically.