Authors: Jiang Li, Junhu Wang, Kewen Wang, Sheng Li
Tags: 2012, conceptual modeling
We study the spelling suggestion problem for keyword search on XML documents. To address the problems in existing work, we propose a distance-based approach to suggesting meaningful query candidates for an issued query. Our approach uses distance to measure the relationship between keyword matching nodes, and ranks a candidate higher if there are closely-related nodes in the database that match the candidate. We design an efficient algorithm to generate top-k query candidates. Experiments with real datasets verified the effectiveness and efficiency of our approach.Read the full paper here: https://link.springer.com/chapter/10.1007/978-3-642-34002-4_14
