Abstract
There is much redundant information in graph-structured which has self-describing characteristic, so how to compress graph-structured so as to improve the efficiency of management of data is becoming more and more significant. This paper studies storage oriented graph-structured compression techniques. For the graph given, many subgraph will be generated. A based on graph traversal, the frequently patterns(fp) can be found. With join the fp patterns, a new fp pattern is produced. Followed by this loop until the threshold, the it result in compression results. Analysis and experiments show that the algorithms have high performance.
This paper was partially supported by NGFR 973 grant 2012CB316200 and NSFC grant. 61003046, 6111113089. Doctoral Fund of Ministry of Education of China (No. 20102302120054). the Fundamental Research Funds for the Central Universities (No. HIT.NSRIF.2013064).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Skibinski, P., Grabowski, S., Swacha, J.: Effective asymmetric XML compression (J/OL). Software- Practice & Experience, http://www.interscience.wiley.com/journal/98517568/issue
Kinno, A., Yukitomo, H., Nakayama, T., Takeshita, A.: Recursive Application of Structural Templates to Efficiently Compress Parsed XML. In: Lowe, D.G., Gaedke, M. (eds.) ICWE 2005. LNCS, vol. 3579, pp. 296–301. Springer, Heidelberg (2005)
Adiego, J., Navarro, G., de la Fuente, P.: Lempel- Ziv compression of structured text. In: Proceedings of the 2004 IEEE Data Compression Conference, Snow - bird, UT, USA, pp. 112–121. IEEE Computer Society, New York (2004)
Toman, V.: Compression of XML data. Charles University, Prague (2003)
Busatto, G., Lohrey, M., Maneth, S.: Efficient Memory Representation of XML Documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 199–216. Springer, Heidelberg (2005)
Neumüller, M.: Compression of XML data. University of Strathclyde, Glasgow (2001)
Augeri, C.J., Mullins, B.E., Baird, L.C., et al.: An analysis of XML compression efficiency. In: Proceedings of the 2007 Workshop on Experimental Computer Science, San Diego, California, USA, pp. 73–84. ACM Press, New York (2007)
Bao, X.Y., Tang, S.W., Wu, L., et al.: ArithRegion—an index structure on compressed XML data. Acta Scientiarum Naturalium Universitatis Pekinensis 42(1), 103–109 (2006)
Jin, Y.Z., Bao, X.Y., Song, Z.S.: ArithBi~+—an XML index structure on reverse arithmetic compressed XML data. Computer Science 32(11), 119–123 (2005)
Bao, X.Y., Tang, S.W., Yang, D.Q.: Interval~+—an index structure on compressed XML data based on interval tree. Journal of Computer Research and Development 43(7), 1285–1290 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, C., Wang, H. (2012). Graph-Structured Data Compression Based on Frequent Subgraph Contraction. In: Bao, Z., et al. Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33050-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-33050-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33049-0
Online ISBN: 978-3-642-33050-6
eBook Packages: Computer ScienceComputer Science (R0)