An extended compact TVP index for finding top-k nearest neighbors over XML data tree

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 0

XRANK: ranked keyword search over XML documents

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Incremental computation and maintenance of temporal aggregates

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient keyword search for smallest LCAs in XML databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Keyword Proximity Search in XML Trees

IEEE Transactions on Knowledge and Data Engineering
Efficient LCA based keyword search in XML data

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
STAR: Steiner-Tree Approximation in Relationship Graphs

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Effective XML Keyword Search with Relevance Oriented Ranking

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Fast ELCA computation for keyword queries on XML data

Proceedings of the 13th International Conference on Extending Database Technology
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a node q and a keyword w, nearest keyword (NK) search is to find the nearest w-neighbor of q which carries the keyword w. NK search provides an approach to exploring XML query problems based on the distance between nodes, such as XPath evaluation and XML keyword search. In this paper, we propose an extended compact TVP index (ecTVP) tailored to find top-k nearest w-neighbors of a given node in XML data tree. The ecTVP index is more compact and faster to build. Both theoretical analysis and experimental result show the advantage of the ecTVP index.