A bit-parallel tree matching algorithm for patterns with horizontal VLDC's

Hisashi Tsuji, Akira Ishino, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

The tree pattern matching problem is, given two labeled trees P and T, respectively called pattern tree and target tree, to find all occurrences of P within T. Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don't-care's (VLDC's) have been introduced. In particular, the path-VLDC's appear in XPath, a language for addressing parts of an XML document. In this paper, we introduce horizontal VLDC's, each matches a sequence of trees whose root nodes are consecutive siblings in ordered trees. We address the tree pattern matching problem for patterns with horizontal VLDC's, In our setting, the target tree is given as a tagged sequence such as XML data stream. We present an algorithm that solves the problem in O(mn) time using O(mh) space, where m and n are the sizes of P and T, respectively, and h is the height of T. We adopt the bit-parallel technique to obtain a practically fast algorithm.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings
Pages388-398
Number of pages11
DOIs
Publication statusPublished - Dec 1 2005
Event12th International Conference on String Processing and Information Retrieval, SPIRE 2005 - Buenos Aires, Argentina
Duration: Nov 2 2005Nov 4 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3772 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on String Processing and Information Retrieval, SPIRE 2005
CountryArgentina
CityBuenos Aires
Period11/2/0511/4/05

Fingerprint

Pattern matching
Tree Algorithms
Matching Algorithm
XML
Horizontal
Pattern Matching
Matching Problem
Ordered Trees
XPath
Labeled Trees
Target
Unordered
Data Streams
Fast Algorithm
Consecutive
Roots
Path
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Tsuji, H., Ishino, A., & Takeda, M. (2005). A bit-parallel tree matching algorithm for patterns with horizontal VLDC's. In String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings (pp. 388-398). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3772 LNCS). https://doi.org/10.1007/11575832_43

A bit-parallel tree matching algorithm for patterns with horizontal VLDC's. / Tsuji, Hisashi; Ishino, Akira; Takeda, Masayuki.

String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. 2005. p. 388-398 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3772 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tsuji, H, Ishino, A & Takeda, M 2005, A bit-parallel tree matching algorithm for patterns with horizontal VLDC's. in String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3772 LNCS, pp. 388-398, 12th International Conference on String Processing and Information Retrieval, SPIRE 2005, Buenos Aires, Argentina, 11/2/05. https://doi.org/10.1007/11575832_43
Tsuji H, Ishino A, Takeda M. A bit-parallel tree matching algorithm for patterns with horizontal VLDC's. In String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. 2005. p. 388-398. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11575832_43
Tsuji, Hisashi ; Ishino, Akira ; Takeda, Masayuki. / A bit-parallel tree matching algorithm for patterns with horizontal VLDC's. String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings. 2005. pp. 388-398 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0fd2f9eef24b47dd9fe237a0ed8a05b7,
title = "A bit-parallel tree matching algorithm for patterns with horizontal VLDC's",
abstract = "The tree pattern matching problem is, given two labeled trees P and T, respectively called pattern tree and target tree, to find all occurrences of P within T. Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don't-care's (VLDC's) have been introduced. In particular, the path-VLDC's appear in XPath, a language for addressing parts of an XML document. In this paper, we introduce horizontal VLDC's, each matches a sequence of trees whose root nodes are consecutive siblings in ordered trees. We address the tree pattern matching problem for patterns with horizontal VLDC's, In our setting, the target tree is given as a tagged sequence such as XML data stream. We present an algorithm that solves the problem in O(mn) time using O(mh) space, where m and n are the sizes of P and T, respectively, and h is the height of T. We adopt the bit-parallel technique to obtain a practically fast algorithm.",
author = "Hisashi Tsuji and Akira Ishino and Masayuki Takeda",
year = "2005",
month = "12",
day = "1",
doi = "10.1007/11575832_43",
language = "English",
isbn = "3540297405",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "388--398",
booktitle = "String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings",

}

TY - GEN

T1 - A bit-parallel tree matching algorithm for patterns with horizontal VLDC's

AU - Tsuji, Hisashi

AU - Ishino, Akira

AU - Takeda, Masayuki

PY - 2005/12/1

Y1 - 2005/12/1

N2 - The tree pattern matching problem is, given two labeled trees P and T, respectively called pattern tree and target tree, to find all occurrences of P within T. Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don't-care's (VLDC's) have been introduced. In particular, the path-VLDC's appear in XPath, a language for addressing parts of an XML document. In this paper, we introduce horizontal VLDC's, each matches a sequence of trees whose root nodes are consecutive siblings in ordered trees. We address the tree pattern matching problem for patterns with horizontal VLDC's, In our setting, the target tree is given as a tagged sequence such as XML data stream. We present an algorithm that solves the problem in O(mn) time using O(mh) space, where m and n are the sizes of P and T, respectively, and h is the height of T. We adopt the bit-parallel technique to obtain a practically fast algorithm.

AB - The tree pattern matching problem is, given two labeled trees P and T, respectively called pattern tree and target tree, to find all occurrences of P within T. Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don't-care's (VLDC's) have been introduced. In particular, the path-VLDC's appear in XPath, a language for addressing parts of an XML document. In this paper, we introduce horizontal VLDC's, each matches a sequence of trees whose root nodes are consecutive siblings in ordered trees. We address the tree pattern matching problem for patterns with horizontal VLDC's, In our setting, the target tree is given as a tagged sequence such as XML data stream. We present an algorithm that solves the problem in O(mn) time using O(mh) space, where m and n are the sizes of P and T, respectively, and h is the height of T. We adopt the bit-parallel technique to obtain a practically fast algorithm.

UR - http://www.scopus.com/inward/record.url?scp=33646720695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646720695&partnerID=8YFLogxK

U2 - 10.1007/11575832_43

DO - 10.1007/11575832_43

M3 - Conference contribution

AN - SCOPUS:33646720695

SN - 3540297405

SN - 9783540297406

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 388

EP - 398

BT - String Processing and Information Retrieval - 12th International Conference, SPIRE 2005, Proceedings

ER -