• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2009 Fiscal Year Final Research Report

Key Technology for XML DB in Embedded Device Based on Efficient Compressed Pattern Matching

Research Project

  • PDF
Project/Area Number 19300008
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Software
Research InstitutionKyushu University

Principal Investigator

TAKEDA Masayuki  Kyushu University, 大学院・システム情報科学研究院, 教授 (50216909)

Co-Investigator(Kenkyū-buntansha) SAKAMOTO Hiroshi  九州工業大学, 情報工学部, 准教授 (50315123)
BANNAI Hideo  九州大学, 大学院・システム情報科学研究院, 准教授 (20323644)
BABA Kensuke  九州大学, 大学院・システム情報科学研究院, 助教 (70380681)
INENAGA Shunsuke  九州大学, 大学院・システム情報科学研究院, 特任准教授 (60448404)
SHINOHARA Ayumi  東北大学, 大学院・情報科学研究科, 教授 (00226151)
ISHINO Akira  東北大学, 大学院・情報科学研究科, 助教 (10315129)
Project Period (FY) 2007 – 2009
Keywordsアルゴリズム / XML / XMLストリーム / 半構造データ / パターン照合 / データ圧縮 / 圧縮パターン照合 / パターン発見
Research Abstract

Standard RDB technique does not perform well in embedded device because of less amount of memory and/or disk storage. Based on our technique of very fast compressed pattern matching, we developed key technique for XML-DB running in embedded devices such as smart phones.

  • Research Products

    (29 results)

All 2010 2009 2008 2007

All Journal Article (26 results) (of which Peer Reviewed: 25 results) Presentation (3 results)

  • [Journal Article] Verifying a Parameterized Border Array in O(n1. 5) Time2010

    • Author(s)
      T. I, S. Inenaga, H. Bannai, M. Takeda
    • Journal Title

      Proc. the 21st Annual Symposium on Combinatorial Pattern Matching (CPM'10) (to appear)

    • Peer Reviewed
  • [Journal Article] Context-sensitive grammar transform: compression and pattern matching2010

    • Author(s)
      S. Maruyama, Y. Tanaka, H. Sakamoto, M. Takeda
    • Journal Title

      IEICE Trans. on Information and Systems (to appear)

    • Peer Reviewed
  • [Journal Article] Finding Missing Patterns2010

    • Author(s)
      S. Angelov, S. Inenaga, T. Kivioja, V. Makinen
    • Journal Title

      J. Discrete Algorithms (to appear)

    • Peer Reviewed
  • [Journal Article] Password Based Anonymous Authentication with Private Information Retrieval2010

    • Author(s)
      T. Nakamura, S. Inenaga, D. Ikeda, K. Baba, H. Yasuura
    • Journal Title

      J. Digital Information Management (to appear)

    • Peer Reviewed
  • [Journal Article] An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs2010

    • Author(s)
      W. Matsubara, S. Inenaga, A. Shinohara
    • Journal Title

      Chicago Journal of Theor. Comput. Sci. (to appear)

    • Peer Reviewed
  • [Journal Article] データ圧縮の理論に基づく効率的な索引構造2010

    • Author(s)
      多比良嘉成, 岸上直也, 田中洋平, 坂本比呂志
    • Journal Title

      日本データベース学会論文誌 8(3)

      Pages: 7-12

    • Peer Reviewed
  • [Journal Article] Dynamic Edit Distance Table under a General Weighted Cost Function2010

    • Author(s)
      H. Hyyro, K. Narisawa, S. Inenaga
    • Journal Title

      Proc. 36th Int. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM2010) LNCS5901

      Pages: 515-527

    • Peer Reviewed
  • [Journal Article] Lightweight Parameterized Suffix Array Construction2009

    • Author(s)
      T. I, S. Deguchi, H. Bannai, S. Inenaga, M. Takeda
    • Journal Title

      Proc. 20th International Workshop on Combinatorial Algorithms (IWOCA'09)

      Pages: 312-323

    • Peer Reviewed
  • [Journal Article] Counting Parameterized Border Arrays for a Binary Alphabet.2009

    • Author(s)
      T. I, S. Inenaga, H. Bannai, M. Takeda
    • Journal Title

      Proc. 3rd Int. Conf. on Language and Automata Theory and Applications (LATA2009) LNCS5457

      Pages: 422-433

    • Peer Reviewed
  • [Journal Article] Finding Characteristic Substrings from Compressed Texts2009

    • Author(s)
      S. Inenaga, H. Bannai
    • Journal Title

      Proc. The Prague Stringology Conference 2009 (PSC 2009)

      Pages: 40-54

    • Peer Reviewed
  • [Journal Article] Bit-parallel algorithms for computing all the runs in a string2009

    • Author(s)
      K. Hirashima, H. Bannai, W. Matsubara, A. Ishino, A. Shinohara
    • Journal Title

      Proc. The Prague Stringology Conference 2009 (PSC 2009)

      Pages: 203-213

    • Peer Reviewed
  • [Journal Article] A Series of Run-rich Strings2009

    • Author(s)
      W. Matsubara, K. Kusano, H. Bannai, A. Shinohara
    • Journal Title

      Proc. 3rd Int. Conf. on Language and Automata Theory and Applications (LATA 2009) LNCS5457

      Pages: 578-587

    • Peer Reviewed
  • [Journal Article] A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.2009

    • Author(s)
      T. Matsumoto, K. Hagio, M. Takeda.
    • Journal Title

      Int. J. Found. Comput. Sci. 20(4)

      Pages: 717-733

    • Peer Reviewed
  • [Journal Article] Efficient algorithms to compute compressed longest common substrings and compressed palindromes2009

    • Author(s)
      W. Matsubara, S. Inenaga, A. Ishino, A. Shinohara, T. Nakamura, K. Hashimoto
    • Journal Title

      Theor. Comput. Sci. 410(8-10)

      Pages: 900-913

    • Peer Reviewed
  • [Journal Article] Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program2009

    • Author(s)
      W. Matsubara, S. Inenaga, A. Shinohara
    • Journal Title

      Proc. 15th Computing: The Australasian Theory Symposium (CATS2009), CRPIT'94

      Pages: 19-28

    • Peer Reviewed
  • [Journal Article] Context-Sensitive Grammar Transform: Compression and Pattern Matching2008

    • Author(s)
      S. Maruyama, Y. Tanaka, H. Sakamoto, M. Takeda
    • Journal Title

      Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE2008) LNCS5280

      Pages: 27-38

    • Peer Reviewed
  • [Journal Article] Parameterized Suffix Arrays for Binary Strings2008

    • Author(s)
      S. Deguchi, F. Higashijima, H. Bannai, S. Inenaga, M. Takeda
    • Journal Title

      Proc. Prague Stringology Conference 2008

      Pages: 84-94

    • Peer Reviewed
  • [Journal Article] New Lower Bounds for the Maximum Number of Runs in a String2008

    • Author(s)
      W. Matsubara, K. Kusano, H. Bannai, A. Ishino, A. Shinohara
    • Journal Title

      The Prague Stringology Conference 2008 (PSC'08)

      Pages: 140-145

    • Peer Reviewed
  • [Journal Article] A Run-Time Efficient Implementation of Compressed Pattern Matching Automata2008

    • Author(s)
      T. Matsumoto, K. Hagio, M. Takeda
    • Journal Title

      Proc. 13th International Conference on Implementation and Application of Automata (CIAA 2008) LNCS5148

      Pages: 201-211

    • Peer Reviewed
  • [Journal Article] A Space-Saving Approximation Algorithm for Grammar-Based Compression2008

    • Author(s)
      H. Sakamoto, S. Maruyama, T. Kida, S. Shimozono
    • Journal Title

      IEICE Trans. on Information and Systems E92-D(2)

      Pages: 158-165

    • Peer Reviewed
  • [Journal Article] Reachability on Suffix Tree Graphs2008

    • Author(s)
      Y. Higa H. Bannai, S. Inenaga, M. Takeda
    • Journal Title

      Int. J. Found. Comput. Sci. 19(1)

      Pages: 147-162

    • Peer Reviewed
  • [Journal Article] Computing longest common substring and all palindromes from compressed strings2008

    • Author(s)
      W. Matsubara, S. Inenaga, A. Ishino, A. Shinohara, T. Nakamura, K. Hashimoto
    • Journal Title

      Int. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM'08) LNCS4910

      Pages: 364-375

    • Peer Reviewed
  • [Journal Article] Efficient Computation of Substring Equivalence Classes with Suffix Arrays2007

    • Author(s)
      K. Narisawa, S. Inenaga, H. Bannai, M. Takeda
    • Journal Title

      Proc. the 18th Annual Symposium on Combinatorial Pattern Matching (CPM'07) LNCS4580

      Pages: 340-351

    • Peer Reviewed
  • [Journal Article] Efficient Reachability Test on Directed Graphs and Its Application to Large XML Data2007

    • Author(s)
      Y. Nakamura, T. Maita, H. Sakamoto
    • Journal Title

      Proc. 3rd IEEE Int. Workshop on Databases for Next-Generation Researchers (SWOD2007)

    • Peer Reviewed
  • [Journal Article] 高速な到達可能性判定のための規模耐性の高い索引付け2007

    • Author(s)
      中村有作, 舞田哲哉, 坂本比呂志
    • Journal Title

      DBSJ Letters 6(1)

      Pages: 77-80

  • [Journal Article] 参照構造を持つXML上の高速な到達可能性判定2007

    • Author(s)
      中村有作, 舞田哲哉, 坂本比呂志
    • Journal Title

      人工知能学会論文誌 22(2)

    • Peer Reviewed
  • [Presentation] 圧縮文字列における最長共通部分文字列および回文を求める多項式時間アルゴリズム2008

    • Author(s)
      松原渉
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      IBM東京基礎研究所
    • Year and Date
      20080300
  • [Presentation] 認証システムのプライバシ保護評価のためのフレームワークの提案2008

    • Author(s)
      中村徹
    • Organizer
      2008年暗号と情報セキュリティシンポジウム
    • Place of Presentation
      フェニックス・シーガイア・リゾート
    • Year and Date
      20080100
  • [Presentation] セキュアな全文検索手法の提案2008

    • Author(s)
      石野明
    • Organizer
      暗号と情報セキュリティシンポジウム(SCIS2008)
    • Place of Presentation
      フェニックス・シーガイア・リゾート
    • Year and Date
      20080100

URL: 

Published: 2011-06-18   Modified: 2014-08-15  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi