An Efficient Algorithm for Tree Mapping in XML Databases

In this article, we discuss an efficient algorithm for tree mapping problem in XML databases. Given a target tree <i>T</i> and a pattern tree <i>Q</i>, the algorithm can find all the embeddings of <i>Q</i> in <i>T</i> in O(|<i>T</i>||<i>Q</i>|) time while the existing approaches need exponential tim... View More