Decomposing DAGs into spanning trees: A new way to compress transitive closures - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yangjun Chen, Yibin Chen. Decomposing DAGs into spanning trees: A new way to compress transitive closures. In Serge Abiteboul, Klemens Böhm, Christoph Koch, Kian-Lee Tan, editors, Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, April 11-16, 2011, Hannover, Germany. pages 1007-1018, IEEE Computer Society, 2011. [doi]

This author has not been identified. Look up 'Yangjun Chen' in GoogleThis author has not been identified. Look up 'Yibin Chen' in Google

runs on WebDSL