Skip to main content
SpringerLink
Log in

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

  • Chapter
  • First Online:
Intelligent Control and Innovative Computing

Part of the book series: Lecture Notes in Electrical Engineering ((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.

This is an extended and revised version of the paper presented at the International Multi-Conference of Engineers and Computer Scientists, Hong Kong, 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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–97

    Google Scholar 

  2. Benoit D, Demaine ED, Munro JI, Raman V (2005) Representing trees of higher degree. Algorithmica 43(4):275–292

    Article  MathSciNet  Google Scholar 

  3. Chiang Y-T, Lin C-C, Lu H-I (2005) Orderly spanning trees with applications. SIAM Journal on Computing, SIAM, 34(4):924–945

    Article  MathSciNet  Google Scholar 

  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–196

    Google Scholar 

  5. Geary RF, Rahman N, Raman R, Raman V (2006) A simple optimal representation for balanced parentheses. Theoretical Computer Science, ELSEVIER 368(3):231–246

    Article  MathSciNet  Google Scholar 

  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–346

    Google Scholar 

  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–40

    Google Scholar 

  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–211

    Google Scholar 

  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–554

    Google Scholar 

  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–584

    Google Scholar 

  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–42

    Google Scholar 

  12. Munro JI, Raman V (2001) Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, SIAM, 31(3):762–776

    Article  MathSciNet  Google Scholar 

  13. Pagh R (2001) Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, SIAM, 31(2):353–363

    Article  MathSciNet  Google Scholar 

  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–284

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Kansei Design, Hiroshima International University, 555-36, Kurose Gakuendai, Higashi Hiroshima, Hiroshima, 739-2695, Japan

    Yuko Itokawa

  2. Department of Information Sciences, Hiroshima City University, 3-4-1, Ozuka-Higashi, Asa-Minami-Ku, Hiroshima, 731-3194, Japan

    Masanobu Wada

  3. Faculty of Information Sciences, Hiroshima City University, 3-4-1, Ozuka-Higashi, Asa-Minami-Ku, Hiroshima, 731-3194, Japan

    Toshimitsu Ishii & Tomoyuki Uchida

Authors
  1. Yuko Itokawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masanobu Wada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshimitsu Ishii
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tomoyuki Uchida
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuko Itokawa .

Editor information

Editors and Affiliations

  1. International Association of Engineers, Hung To Road, Unit 1, 1/F, 37-39, Hong Kong, China

    Sio Iong Ao

  2. Computer Science, Tijuana Institute of Technology, Chula Vista, 91909, California, USA

    Oscar Castillo

  3. , Faculty of Information Sciences & Eng., University of Canberra, Canberra, 2601, Aust Capital Terr, Australia

    Xu Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Itokawa, Y., Wada, M., Ishii, T., Uchida, T. (2012). Pattern Matching Algorithm Using a Succinct Data Structure for Tree-Structured Patterns. In: Ao, S., Castillo, O., Huang, X. (eds) Intelligent Control and Innovative Computing. Lecture Notes in Electrical Engineering, vol 110. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1695-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-1695-1_27

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-1694-4

  • Online ISBN: 978-1-4614-1695-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation