ACM Home Page
Please provide us with feedback. Feedback
XML keyword query refinement
Full text PdfPdf (316 KB)
Source
International Conference on Management of Data archive
Proceedings of the First International Workshop on Keyword Search on Structured Data table of contents
Providence, Rhode Island
POSTER SESSION: Demos and posters table of contents
Pages 41-42  
Year of Publication: 2009
ISBN:978-1-60558-570-3
Authors
Jiaheng Lu  Renmin University of China
Zhifeng Bao  National University of Singapore
Tok Wang Ling  National University of Singapore
Xiaofeng Meng  Renmin University of China
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557670.1557685
What is a DOI?

ABSTRACT

Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, spelling errors etc, which causes the search results to be either empty or not meaningful. In this paper, we introduce the problem of XML keyword query refinement, and propose a set of effective and efficient solutions. Finally, extensive experiments show the efficiency and effectiveness of our approach.



Collaborative Colleagues:
Jiaheng Lu: colleagues
Zhifeng Bao: colleagues
Tok Wang Ling: colleagues
Xiaofeng Meng: colleagues