Advertisement

Pattern Matching Algorithm Using a Succinct Data Structure for Tree-Structured Patterns

  • Yuko Itokawa
  • Masanobu Wada
  • Toshimitsu Ishii
  • Tomoyuki Uchida
Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 110)

Abstract

Two things are important in developing a fast, memory-efficient graph mining method that extracts characteristic graph structures from Web pages and other tree-structured data. One is tree patterns that can express the features of a graph structure and the other is data structures for tree patterns and for representing tree-structured data. In this paper, we first apply a depth-first unary degree sequence (DFUDS), which is one succinct data structure for an ordered tree, as a succinct data structure for tree patterns that express the features of a graph structure. We then propose a pattern matching algorithm that uses the DFUDS succinct data structure, to determine whether or not a given tree-structured data has features of tree pattern. We also implement the proposed algorithm on a computer and evaluate the algorithm by experiment. The results are reported and discussed.

Keywords

Graph algorithm Succinct data structure Tree pattern matching Tree structured data 

References

  1. 1.
    Arroyuelo D, Cánovas B, Navarro G, Sadakane K (2010) Succinct trees in practice. In Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 84–97Google Scholar
  2. 2.
    Benoit D, Demaine ED, Munro JI, Raman V (2005) Representing trees of higher degree. Algorithmica 43(4):275–292CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Chiang Y-T, Lin C-C, Lu H-I (2005) Orderly spanning trees with applications. SIAM Journal on Computing, SIAM, 34(4):924–945CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Ferragina P, Luccio F, Manzini G, Muthukrishnan S (2005) Structuring labeled trees for optimal succinctness, and beyond. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), IEEE, 184–196Google Scholar
  5. 5.
    Geary RF, Rahman N, Raman R, Raman V (2006) A simple optimal representation for balanced parentheses. Theoretical Computer Science, ELSEVIER 368(3):231–246CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Itokawa Y, Katoh K, Uchida T, Shoudai T (2010) Algorithm using expanded LZ compression scheme for compressing tree structured data. Lecture notes in electrical engineering. Springer, Berlin, pp 333–346Google Scholar
  7. 7.
    Itokawa Y, Miyoshi J, Wada M, Uchida T (2010) Succinct representation of ttsp graphs and its application to the path search problem. In Proceedings of the Sixth IASTED International Conference on Advances in Computer Science and Engineering IASTED, pp 33–40Google Scholar
  8. 8.
    Itokawa T, Wada M, Ishii T, Uchida T (2011) Tree pattern matching algorithm using a succinct data structure. In Lecture notes in engineering and computer science: Proceedings of the international multiConference of engineers and computer scientists 2011, IMECS 2011, 16–18 March, 2011, Hong Kong, pp 206–211Google Scholar
  9. 9.
    Jacobson G (1989) Space-efficient static trees and graphs. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS’89), IEEE, 549–554Google Scholar
  10. 10.
    Jansson J, Sadakane K, Sung W-K (2007) Ultra-succinct representation of ordered trees. In Proceedings of the eighteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA’07), Society for Industrial and Applied Mathematics, 575–584Google Scholar
  11. 11.
    Munro JI (1996) Table. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 18–20 December, Hyderabad, India, Lecture Notes in Computer Science Vol. 1180, Springer, pp 37–42Google Scholar
  12. 12.
    Munro JI, Raman V (2001) Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, SIAM, 31(3):762–776CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Pagh R (2001) Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, SIAM, 31(2):353–363CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Suzuki Y, Inomae K, Shoudai T, Miyahara T, Uchida T (2003) A polynomial time matching algorithm of structured ordered tree patterns for data mining from semistructured data. In Proceedings the 12th international conference on inductive logic programming, ILP 2002, 9-11 July, Sydney, Australia, Lecture Notes in Computer Science, Vol. 2583, Springer, pp 270–284Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Yuko Itokawa
    • 1
  • Masanobu Wada
    • 2
  • Toshimitsu Ishii
    • 3
  • Tomoyuki Uchida
    • 3
  1. 1.Department of Kansei DesignHiroshima International UniversityHigashi HiroshimaJapan
  2. 2.Department of Information SciencesHiroshima City UniversityAsa-Minami-KuJapan
  3. 3.Faculty of Information SciencesHiroshima City UniversityAsa-Minami-KuJapan

Personalised recommendations