Group-by skyline query processing in relational engines
Group-by skyline query processing in relational engines
复制标题
DOI：
10.1145/1645953.1646138
复制
发表时间：
2009-11
期刊：
影响因子：
--
通讯作者：
Ming-Hay Luk;Man Lung Yiu;Eric Lo
中科院分区：
文献类型：
--
作者：
Ming-Hay Luk;Man Lung Yiu;Eric Lo
skyline算子最早是在2001年提出的，用于从数据集中检索感兴趣的元组。从那时起，发表了100多篇与天际线相关的论文；然而，我们发现最直观和实用的天际线查询类型之一，即按天际线分组查询仍然没有得到解决。按组的天际线查询查找每组元组的天际线。在本文中，我们提出了在关系引擎的背景下处理组-天际线查询的全面研究。具体地说，我们研究了按群查询的查询计划的组成，并为BBS算法开发了缺失成本模型。实验结果表明，我们的技术能够为各种按天际线分组查询设计出最佳的查询计划。我们关注的是可以直接在今天的商业数据库系统中实现的算法，而不需要增加新的访问方法（这需要解决与更新、并发控制等相关的维护挑战）。
The skyline operator was first proposed in 2001 for retrieving interesting tuples from a dataset. Since then, 100+ skyline-related papers have been published; however, we discovered that one of the most intuitive and practical type of skyline queries, namely, group-by skyline queries remains unaddressed. Group-by skyline queries find the skyline for each group of tuples. In this paper, we present a comprehensive study on processing group-by skyline queries in the context of relational engines. Specifically, we examine the composition of a query plan for a group-by skyline query and develop the missing cost model for the BBS algorithm. Experimental results show that our techniques are able to devise the best query plans for a variety of group-by skyline queries. Our focus is on algorithms that can be directly implemented in today's commercial database systems without the addition of new access methods (which would require addressing the associated challenges of maintenance with updates, concurrency control, etc.).