Removing the mismatch headache in XML keyword search
conference contribution
posted on 2023-05-23, 08:58authored byZeng, Y, Bao, Z, Ling, TW, Li, G
In this demo, we study one category of query refinement problems in the context of XML keyword search, where what users search for do not exist in the data while useless results are returned by the search engine. It is a hidden but important problem. We refer to it as the MisMatch problem. We propose a practical yet efficient way to detect the Mis- Match problem and generate helpful suggestions to users, namely MisMatch detector and suggester. Our approach can be viewed as a post-processing job of query evaluation. An online XML keyword search engine embedding the Mis- Match detector and suggester has been built and is available at [1].
History
Publication title
Proceedings of the 36th Annual ACM Special Interest Group on Information Retrieval
Pagination
1109-1110
ISBN
978-1-4503-2034-4
Department/School
School of Information and Communication Technology
Publisher
Association for Computing Machinery
Place of publication
United States of America
Event title
36th Annual ACM Special Interest Group on Information Retrieval 2013
Event Venue
Dublin, Ireland
Date of Event (Start Date)
2013-07-28
Date of Event (End Date)
2013-08-01
Rights statement
Copyright 2013 ACM
Repository Status
Restricted
Socio-economic Objectives
Information systems, technologies and services not elsewhere classified