TY  - JOUR
AU  - Chen, Yangjun 
PY  - 2007
TI  - An Efficient Algorithm for Tree Mapping in XML Databases
JF  - Journal of Computer Science
VL  - 3
IS  - 7
DO  - 10.3844/jcssp.2007.487.493
UR  - https://thescipub.com/abstract/jcssp.2007.487.493
AB  - 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.