Efficiently computing RKN for keyword queries on XML data

Subtree results construction is a core problem in keyword query processing over XML data,for which com-puting the set of relevant keyword nodes (RKN) for each subtree's root node will greatly affect the overall system per-formance. Considering that existing methods cannot correctly identify RKN...

Full description

Bibliographic Details

Published in:	Tongxin xuebao
Main Authors:	HENZi-yang C, ANGXuan W, ANGXian T
Format:	Article
Language:	Chinese
Published:	Editorial Department of Journal on Communications 2014-07-01
Subjects:	XML subtree results construction ELCA RKN
Online Access:	http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.07.006/