Effective XML keyword search through valid lowest information unit

Authors:
Ying Lou;Peng Wang;Zhanhuai Li;Qun Chen;Xia Li
Affiliations:
School of Computer, Northwestern Polytechnical University, Xi'an, China;School of Computer, Northwestern Polytechnical University, Xi'an, China;School of Computer, Northwestern Polytechnical University, Xi'an, China;School of Computer, Northwestern Polytechnical University, Xi'an, China;School of Computer, Northwestern Polytechnical University, Xi'an, China
Venue:
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Year:
2010

Citing 9
Cited 0

XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Identifying meaningful return information for XML keyword search

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XSEarch: a semantic search engine for XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Schema-free XQuery

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Effective keyword search for valuable lcas over xml documents

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment
Effective XML Keyword Search with Relevance Oriented Ranking

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.