Reducing redundancy in XML Keyword Search by indirect-SLCA

In this paper, we study the problem of the data redundancy in XML Keyword Search by SLCA and propose a new mode to resolve it. We begin by introducing the notion of SLCA and analyzing its faults. Then we propose the concept of Indirect-SLCA (ISLCA) to reduce the redundancy basing on the notion of Heterogeneous node. In order to speed up the computation of ISLCA, we improve the Dewey code by bring in the labelpsilas information. And we name the new one LDC. At last we give an Algorithm to compute the ISLCA.