Efficient and scalable trie-based algorithms for computing set containment relations.
Yongming LuoGeorge H. L. FletcherJan HiddersPaul De BraPublished in: ICDE (2015)
Keyphrases
- highly scalable
- data structure
- computationally efficient
- memory efficient
- limited memory
- single pass
- computationally complex
- efficient solutions
- highly efficient
- computationally expensive
- times faster
- algorithmic solutions
- computationally demanding
- computationally intensive
- graph theory
- recently developed
- real time
- computational efficiency
- benchmark datasets
- theoretical analysis
- lightweight
- worst case
- computational complexity
- learning algorithm
- neural network
- orders of magnitude
- data mining techniques
- pruning strategy
- significant improvement
- parallel architectures