Effectively inferring the search-for node type in XML keyword search

Authors:
Jiang Li;Junhu Wang
Affiliations:
School of Information and Communication Technology, Griffith University, Gold Coast, Australia;School of Information and Communication Technology, Griffith University, Gold Coast, Australia
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Year:
2010

Citing 9
Cited 1

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
Keyword Proximity Search in XML Trees

IEEE Transactions on Knowledge and Data Engineering
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
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

Effectively return query results for keyword search on XML data

WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management

Quantified Score

Hi-index	0.01

Visualization

Abstract

xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword queries. XReal [4] utilizes the statistics of underlying data to resolve keyword ambiguity problems. However, we found their proposed formula for inferring the search-for node type suffers from inconsistency and abnormality problems. In this paper, we propose a dynamic reduction factor scheme as well as a novel algorithm DynamicInfer to resolve these two problems. Experimental results are provided to verify the effectiveness of our approach.