Rule-driven processing of tree-structured data using pointed trees

Nikita Schmidt, Ahmed Patel

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed.

Original languageEnglish
Pages (from-to)463-475
Number of pages13
JournalComputer Standards and Interfaces
Volume25
Issue number5
DOIs
Publication statusPublished - Sep 2003
Externally publishedYes

Fingerprint

Data structures
Processing
Query

Keywords

  • Pointed tree
  • Regular expression
  • Transducer
  • Tree walking
  • Tree-structured data

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Information Systems and Management

Cite this

Rule-driven processing of tree-structured data using pointed trees. / Schmidt, Nikita; Patel, Ahmed.

In: Computer Standards and Interfaces, Vol. 25, No. 5, 09.2003, p. 463-475.

Research output: Contribution to journalArticle

Schmidt, Nikita ; Patel, Ahmed. / Rule-driven processing of tree-structured data using pointed trees. In: Computer Standards and Interfaces. 2003 ; Vol. 25, No. 5. pp. 463-475.
@article{65966a8546754fb481063a818b0ce93d,
title = "Rule-driven processing of tree-structured data using pointed trees",
abstract = "This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed.",
keywords = "Pointed tree, Regular expression, Transducer, Tree walking, Tree-structured data",
author = "Nikita Schmidt and Ahmed Patel",
year = "2003",
month = "9",
doi = "10.1016/S0920-5489(03)00068-0",
language = "English",
volume = "25",
pages = "463--475",
journal = "Computer Standards and Interfaces",
issn = "0920-5489",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Rule-driven processing of tree-structured data using pointed trees

AU - Schmidt, Nikita

AU - Patel, Ahmed

PY - 2003/9

Y1 - 2003/9

N2 - This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed.

AB - This paper puts forward a data model based on pointed unranked trees labelled with arbitrary strings. An abstract transformation machine for this data model is presented that combines rule-driven processing with a very simple query mechanism. This machine is shown to be able to express any computable tree transformation. This suggests that the rule-driven processing principle is a powerful tool even when it is used in conjunction with a simple and weak query model. An implementation of this machine enhanced with regular expression-based query mechanism is discussed.

KW - Pointed tree

KW - Regular expression

KW - Transducer

KW - Tree walking

KW - Tree-structured data

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

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

U2 - 10.1016/S0920-5489(03)00068-0

DO - 10.1016/S0920-5489(03)00068-0

M3 - Article

AN - SCOPUS:0042468086

VL - 25

SP - 463

EP - 475

JO - Computer Standards and Interfaces

JF - Computer Standards and Interfaces

SN - 0920-5489

IS - 5

ER -