QQ客服 官方微博 反馈留言

	Discovery of frequent XML query patterns with DTD cardinality constraints
	Liu, YF ; Yang, DQ ; Tang, SW ; Wang, TJ ; Gao, J
	2004
英文摘要	Common query patterns of multiple XML queries can be stored and shared to accelerate the query execution efficiently. We present a new technique for efficiently mining frequent XML query patterns with DTD cardinality constraints. We first introduce a new definition of extended subtree for XML query patterns (EST), which provides a model for supporting special characters of "common" XML query pattern. Then we "push" the DTD cardinality constraints deep into the mining process to prune the search space and still ensure the completeness of the answers. Finally, we propose an algorithm FEST for effectively mining frequent ESTs to improve the query performance for XML data management system.; Computer Science, Information Systems; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/292272]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Liu, YF,Yang, DQ,Tang, SW,et al. Discovery of frequent XML query patterns with DTD cardinality constraints. 2004-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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