A distance-based spelling suggestion method for XML keyword search

Authors:
Sheng Li;Junhu Wang;Kewen Wang;Jiang Li
Affiliations:
School of Information and Communication Technology, Griffith University, Australia;School of Information and Communication Technology, Griffith University, Australia;School of Information and Communication Technology, Griffith University, Australia;School of Information and Communication Technology, Griffith University, Australia
Venue:
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Year:
2012

Citing 8
Cited 2

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
XSeek: a semantic XML search engine using keywords

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Keyword query cleaning

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
Using structural information in XML keyword search effectively

ACM Transactions on Database Systems (TODS)
Nearest keyword search in XML documents

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
XClean: Providing valid spelling suggestions for XML keyword queries

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

Spelling suggestion for XML keyword search based on pairwise keyword summaries

WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Spelling Suggestion for XML Keyword Search Based on XSketch Synopsis

Proceedings of International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.