Abstract
AbstractGiven a text tree t and a pattern tree p, tree pattern matching involves finding subtrees of t which match p. This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in O(log n) parallel time using mn/logn processors on CREW‐PRAM, where n and m are the sizes of t and p respectively. This improves the result of Ramesh et al. that runs in O(log2n) time using nr/log2n processors, where r is the number of vertices of p labeled with variables. Futhermore, the method of processor allocation is described specifically in the proposed algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
