Spelling suggestion for XML keyword search based on pairwise keyword summaries

Authors:
Sheng Li;Junhu Wang
Affiliations:
School of Information and Communication Technology, Griffith University, Australia;School of Information and Communication Technology, Griffith University, Australia
Venue:
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Year:
2012

Citing 10
Cited 1

Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Effective keyword-based selection of relational databases

Proceedings of the 2007 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
LCA-based selection for XML document collections

Proceedings of the 19th international conference on World wide web
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
K-graphs: selecting top-k data sources for XML keyword queries

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
A distance-based spelling suggestion method for XML keyword search

ER'12 Proceedings of the 31st international conference on Conceptual Modeling

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 over an XML document, which provides users with alternative queries that may better express users' search intention. In order to return the query candidates more efficiently, we calculate the correlations between pairwise keywords, which consider the distribution of keywords and the structures of the XML document. We use the keyword correlations as the summaries of the XML document, which are built off-line. We propose an approach to generating the query candidates, and rank them based on the summaries. Experiments with real datasets verifies the effectiveness and efficiency of our approach.