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


Kanne, Carl-Christian ; Moerkotte, Guido


URL: http://www.vldb.org/conf/2006/p91-kanne.pdf
Document Type: Conference or workshop publication
Year of publication: 2006
Book title: Proceedings of the 32nd International Conference on Very Large Data Bases : VLDB 2006; September 12-15, 2006, Coex, Seoul, Korea
Volume: 1
Page range: 91-102
Author/Publisher of the book
(only the first ones mentioned)
:
Dayal, Umeshwar
Place of publication: Red Hook, NY
Publishing house: Curran
ISSN: 1-59593-385-9
Publication language: English
Institution: School of Business Informatics and Mathematics > Praktische Informatik III (Moerkotte)
School of Business Informatics and Mathematics > Praktische Informatik (Informationssysteme) (Juniorprofessur) (Kanne -2012)
Subject: 004 Computer science, internet

Dieser Eintrag ist Teil der Universitätsbibliographie.




+ Citation Example and Export

Kanne, Carl-Christian ; Moerkotte, Guido A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix. Dayal, Umeshwar 1 91-102 In: Proceedings of the 32nd International Conference on Very Large Data Bases : VLDB 2006; September 12-15, 2006, Coex, Seoul, Korea (2006) Red Hook, NY [Conference or workshop publication]


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item