DocumentCode
2306456
Title
Reducing redundancy in XML Keyword Search by indirect-SLCA
Author
Gao Dandan ; Wang Xinjun ; Zhang Lihua
Author_Institution
Dept. of Comput. Sci. & Technol., Shandong Univ., Jinan
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
174
Lastpage
177
Abstract
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.
Keywords
XML; redundancy; Dewey code; SLCA; XML keyword search; data redundancy; lowest common ancestor; Computer science; Computer science education; Data analysis; Databases; Educational technology; Information analysis; Keyword search; Proposals; Redundancy; XML;
fLanguage
English
Publisher
ieee
Conference_Titel
IT in Medicine and Education, 2008. ITME 2008. IEEE International Symposium on
Conference_Location
Xiamen
Print_ISBN
978-1-4244-3616-3
Electronic_ISBN
978-1-4244-2511-2
Type
conf
DOI
10.1109/ITME.2008.4743846
Filename
4743846
Link To Document