Tree compression with top trees

Authors:
Philip Bille;Inge Li Gørtz;Gad M. Landau;Oren Weimann
Affiliations:
DTU Compute, Technical University of Denmark, Denmark;DTU Compute, Technical University of Denmark, Denmark;University of Haifa, Israel;University of Haifa, Israel
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Year:
2013

Citing 16
Cited 1

Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Succinct Representation of Balanced Parentheses and Static Trees

SIAM Journal on Computing
Maintaining Center and Median in Dynamic Trees

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Minimizing Diameters of Dynamic Trees

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Succinct ordinal trees with level-ancestor queries

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining information in fully dynamic trees with top trees

ACM Transactions on Algorithms (TALG)
Representing Trees of Higher Degree

Algorithmica
The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
User modeling for personalized Web search with self-organizing map: Research Articles

Journal of the American Society for Information Science and Technology
Path queries on compressed XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient memory representation of XML document trees

Information Systems
Space-efficient static trees and graphs

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Compressing and indexing labeled trees, with applications

Journal of the ACM (JACM)
Random access to grammar-compressed strings

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The smallest grammar problem

IEEE Transactions on Information Theory

XML tree structure compression using RePair

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.