Output details
11 - Computer Science and Informatics
University of Edinburgh
Return to search
Output 0 of 0 in the submission
Article title
XML tree structure compression using RePair
Type
D - Journal article
Title of journal
Information Systems
Article number
-
Volume number
38
Issue number
8
First page of article
1150
ISSN of journal
0306-4379
Year of publication
2013
Number of additional authors
2
Additional information
<15> Originality: This paper introduces the most efficient grammar compressor for trees and shows it is an order of magnitude faster than previous compressors. This provides the smallest pointer-based in-memory representation for repetitive trees such as XML and provides a better time/space trade-off than other tree data structures.
Significance: The results have many applications: queries can be executed directly on the compressed structure thus giving speedup, the compressed structures can be used as XML synopses, and the compressor discovers repeating tree patterns which is useful for data mining.
Rigour: A new algorithm is presented together with an extensive experimental evaluation.
Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
