An Efficient Algorithm for Tree Mapping in XML Databases
Yangjun Chen · Journal of Computer Science · 2007
In 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.