TY - GEN
T1 - Effective XML keyword search through valid lowest information unit
AU - Lou, Ying
AU - Wang, Peng
AU - Li, Zhanhuai
AU - Chen, Qun
AU - Li, Xia
N1 - Funding Information:
Acknowledgement. This work is supported by the National Natural Science Foundation of China under Grant No. 60803043 and No. 60720106001, the National High Technology Development 863 Program of China under Grant No. 2009AA1Z134.
PY - 2010
Y1 - 2010
N2 - Keyword search for XML documents has attracted much attention recently. Existing approaches mainly retrieve search results through identifying the Lowest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately investigated. To address this challenge, we first introduce the notion of Information Unit (IU). Its structural property ensures that it can provide complete information on topic to user. We then reason whether a search result is valid by analyzing the context of keyword match nodes. We propose that a meaningful returned result should be a Valid Lowest Information unit (VLIU), which is the lowest IU that contains all the keywords and is semantically valid. Finally, we conduct extensive experiments to demonstrate the effectiveness and efficiency of our approach.
AB - Keyword search for XML documents has attracted much attention recently. Existing approaches mainly retrieve search results through identifying the Lowest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately investigated. To address this challenge, we first introduce the notion of Information Unit (IU). Its structural property ensures that it can provide complete information on topic to user. We then reason whether a search result is valid by analyzing the context of keyword match nodes. We propose that a meaningful returned result should be a Valid Lowest Information unit (VLIU), which is the lowest IU that contains all the keywords and is semantically valid. Finally, we conduct extensive experiments to demonstrate the effectiveness and efficiency of our approach.
KW - IU
KW - VLIU
KW - XML
KW - keyword search
UR - https://www.scopus.com/pages/publications/78649964054
U2 - 10.1007/978-3-642-16720-1_8
DO - 10.1007/978-3-642-16720-1_8
M3 - Conference contribution
AN - SCOPUS:78649964054
SN - 3642167195
SN - 9783642167195
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 94
BT - Web-Age Information Management - WAIM 2010 International Workshops
T2 - 1st International Workshop on Graph Database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML Data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010
Y2 - 15 July 2010 through 17 July 2010
ER -