QQ客服 官方微博 反馈留言

	QReduction: Synopsizing XPath query set efficiently under resource constraint
	Gao, J ; Ma, XL ; Yang, DQ ; Wang, TJ ; Tang, SW
	2004
关键词	XML DOCUMENTS
英文摘要	How to evaluate a massive XPath set over XML streams poses great challenges to database researchers. Current work chiefly focuses on evaluating efficiently massive XPath set to obtain precise results. The size of the input query set has a great impact on the resource requirement and the efficiency of evaluation. In this paper, we propose a novel method, QReduction, to obtain the synopsized XPath query set to represent the original query set, while at the same time to minimize the 'precision loss' caused by query set synopsis. QReduction discovers frequent patterns among the massive input XPath tree patterns first, and select query set synopsis from them based on a dynamic benefit model under resource constraints. Since frequent patterns discovery takes high complexity in QReduction, we propose optimization methods by pushing the constraints of QReduction into the discovery process. We propose 3 criteria, namely recall, precision and intersection to determine a better synopsis. The experimental results demonstrate that our method can produce a query set synopsis with high precision, recall and intersection under given resource constraints.; Computer Science, Information Systems; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/292270]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Gao, J,Ma, XL,Yang, DQ,et al. QReduction: Synopsizing XPath query set efficiently under resource constraint. 2004-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。