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 lndirect-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 labels information. And we name the new one LDC. At last we give an Algorithm to compute the ISLCA.

作者: GAO Dandan WANG Xinjun ZHANG Lihua

作者单位: Department of Computer Science and Technology,Shandong University,Jinan,250101,China

会议类型: 国际会议

会议名称: 2008 IEEE International Symposium on IT in Medicine and Education(2008信息技术在医学和教育中的应用国际研讨会)(ITME 2008)

会议地点: 厦门

会议语种:英文

页码: 174-177

在线出版日期: 2008-12-12（万方平台首次上网日期，不代表论文的发表时间）