Efficient MSubtree results computation for XML keyword queries

Authors:
Junfeng Zhou;Jinjia Zhao;Bo Wang;Xingmin Zhao;Ziyang Chen
Affiliations:
School of Information Science and Engineering, Yanshan University, Qinhuangdao, China;School of Information Science and Engineering, Yanshan University, Qinhuangdao, China;School of Information Science and Engineering, Yanshan University, Qinhuangdao, China;School of Information Science and Engineering, Yanshan University, Qinhuangdao, China;School of Information Science and Engineering, Yanshan University, Qinhuangdao, China
Venue:
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Year:
2013

Citing 6
Cited 0

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
Reasoning and identifying relevant matches for XML keyword search

Proceedings of the VLDB Endowment
Retrieving meaningful relaxed tightest fragments for XML keyword search

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Fast result enumeration for keyword queries on XML data

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on efficient constructing of matched subtree (MSubtree) results for keyword queries on XML data. We firstly show that the performance bottlenecks for existing methods lie in (1) computing the set of relevant keyword nodes (RKNs) for each subtree root node, (2) constructing the corresponding MSubtrees, and (3) parallel execution. We then propose a two-step generic top-down subtree construction algorithm, which computes SLCA/ELCA nodes in the first step, and parallelly gets RKNs and generates MSubtree results in the second step, where generic means that (1) our method can be used to compute different kinds of subtree results, (2) our method is independent of the query semantics; top-down means that our method constructs each MSubtree by visiting nodes of the subtree constructed based on an RKN set level-by-level from left to right, such that to avoid visiting as many useless nodes as possible.