Efficiently Processing Subspace l-SkyRex Queries
首发时间:2013-02-28
Abstract:Subspace l-SkyRex query processing has recently received a lot of attention in database community. Given a set of multidimensional objects, l-SkyRex query on Subspace V finds the objects that are dominated by at most l objects on this subspace. In multi-user environments, skyline analysis systems need the capabilities to optimize multiple subspace l-SkyRex queries simultaneously. Therefore, for this purpose, we also propose AOMSSQ (Algorithm for Optimizing Multiple Subspace l-SkyRex Queries), the first efficient sound and complete algorithm to optimize multiple subspace l-SkyRex queries in multi-user environments. Finally, we discuss two interesting variations of subspace l-SkyRex query, i.e., global constraint subspace l-SkyRex query and local constraint subspace l-SkyRex query, which are meaningful in practice, and show how our solutions can be applied for their efficient processing. Detailed theoretical analyses and extensive experiments that demonstrate our algorithms are both efficient and effective.
keywords: database l-SkyRex query subspace query optimization
点击查看论文中文信息
有效处理子空间l-SkyRex查询
摘要:l-SkyRex查询处理是近年来数据库领域的一个研究重点和热点。在多用户环境中,查询系统往往需要同时接收不同用户在多个子空间上的l-SkyRex查询。因此,为了缩减总响应时间,给出一种优化多个子空间l-SkyRex查询的有效方法AOMSSQ (Algorithm for Optimizing Multiple Subspace l-SkyRex Queries)。 AOMSSQ 算法将多个l-SkyRex查询组织成一棵子空间查询树,并利用树上各节点间的共享机制来优化多个l-SkyRex查询的总效率。此外,讨论了两个有意义的变种,即全局约束子空间l-SkyRex查询和局部约束子空间l-SkyRex查询。理论分析和实验结果表明,文章给出的方法具有有效性和实用性。
关键词: 数据库 l-SkyRex查询 子空间 查询优化
基金:
论文图表:
引用
No.****
同行评议
共计0人参与
勘误表
有效处理子空间l-SkyRex查询
评论
全部评论0/1000