Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00191867" target="_blank" >RIV/68407700:21240/11:00191867 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.springerlink.com/content/x747k54j4v75/#section=927840&page=1&locus=0" target="_blank" >http://www.springerlink.com/content/x747k54j4v75/#section=927840&page=1&locus=0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-22256-6" target="_blank" >10.1007/978-3-642-22256-6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

Popis výsledku v původním jazyce

We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the general case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.

Název v anglickém jazyce

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata

Popis výsledku anglicky

We consider the problem of tree template matching in ranked ordered trees, and propose a solution based on the bottom-up technique. Specifically, we transform the tree pattern matching problem to a string matching problem, by transforming the tree template and the subject tree to strings representing their postfix notation, and then use pushdown automata as the computational model. The method is analogous to the construction of string pattern matchers. The given tree template is preprocessed once, by constructing a nondeterministic pushdown automaton, which is then transformed to the equivalent deterministic one. Although we prove that the space required for preprocessing is exponential to the size of the tree template in the general case, the space required for a specific class of tree templates is linear. The time required for the searching phase is linear to the size of the subject tree in both cases.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: Analýza a zpracování řetězců a stromů</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

6807

Číslo periodika v rámci svazku

—

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

9

Strana od-do

273-281

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—