A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix

Carl-Christian Kanne, Guido Moerkotte. A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix. In Umeshwar Dayal, Kyu-Young Whang, David B. Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, Young-Kuk Kim, editors, Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006. pages 91-102, ACM, 2006. [doi]

Abstract

Abstract is missing.