Parallel tree pattern matching

R. Ramesh; I. V. Ramakrishnan

doi:10.1016/S0747-7171(08)80023-5

Parallel tree pattern matching

R. Ramesh
, I. V. Ramakrishnan

Computer Science

University of Texas at Dallas

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.

Original language	English
Pages (from-to)	485-501
Number of pages	17
Journal	Journal of Symbolic Computation
Volume	9
Issue number	4
DOIs	https://doi.org/10.1016/S0747-7171(08)80023-5
State	Published - 1990

Access to Document

10.1016/S0747-7171(08)80023-5

Cite this

@article{ac0f6b5520f14048b63dfb118dc8bacf,

title = "Parallel tree pattern matching",

abstract = "Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.",

author = "R. Ramesh and Ramakrishnan, \{I. V.\}",

year = "1990",

doi = "10.1016/S0747-7171(08)80023-5",

language = "English",

volume = "9",

pages = "485--501",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

number = "4",

}

TY - JOUR

T1 - Parallel tree pattern matching

AU - Ramesh, R.

AU - Ramakrishnan, I. V.

PY - 1990

Y1 - 1990

N2 - Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.

AB - Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.

UR - https://www.scopus.com/pages/publications/84990704910

U2 - 10.1016/S0747-7171(08)80023-5

DO - 10.1016/S0747-7171(08)80023-5

M3 - Article

AN - SCOPUS:84990704910

SN - 0747-7171

VL - 9

SP - 485

EP - 501

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - 4

ER -

Parallel tree pattern matching

Abstract

Access to Document

Other files and links

Fingerprint

Cite this