Efficient and scalable trie-based algorithms for computing set containment relations - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yongming Luo, George H. L. Fletcher, Jan Hidders, Paul De Bra. Efficient and scalable trie-based algorithms for computing set containment relations. In Johannes Gehrke, Wolfgang Lehner, Kyuseok Shim, Sang Kyun Cha, Guy M. Lohman, editors, 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015. pages 303-314, IEEE, 2015. [doi]

This author has not been identified. Look up 'Yongming Luo' in GoogleThis author has not been identified. It may be one of the following persons:

George H. L. Fletcher

Look up 'George H. L. Fletcher' in GoogleThis author has not been identified. It may be one of the following persons:

Jan Hidders

Look up 'Jan Hidders' in GoogleThis author has not been identified. Look up 'Paul De Bra' in Google

runs on WebDSL