3 results for “Yangjun Chen”

Research ArticleOpen accessIn the author namesA New Algorithm for Subset Matching ProblemYangjun ChenThe subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet ∑. The pattern is said to occur at text position i if the set p[j] is a subset of the … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,737 accessesView PDF Cite

Research ArticleOpen accessIn the author namesAn Efficient Algorithm for Tree Mapping in XML DatabasesYangjun ChenIn this article, we discuss an efficient algorithm for tree mapping problem in XML databases. Given a target tree T and a pattern tree Q, the algorithm can find all the embeddings of Q in T in O(|T||Q|) time while the existing approaches need exponential time in the worst case. …Journal of Computer Science, Vol. 3, Issue 7 · 21 Jul 2007 · 6,567 accessesView PDF Cite