面向多租户数据库的Skyline处理算法

计算机科学与探索 ›› 2011, Vol. 5 ›› Issue (4): 289-304.

面向多租户数据库的Skyline处理算法

孙圣力^1,2, 黄震华³, 李鹏^1,2

1. 北京大学软件与微电子学院, 北京 100871
2. 北京大学软件与微电子学院无锡基地, 江苏无锡 214125
3. 同济大学电子与信息工程学院, 上海 200092

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-04-01 发布日期:2011-04-01

Skyline Computation over Multi-tenant Database System

SUN Shengli, HUANG Zhenhua, LI Peng

1. School of Software and Microelectronics, Peking University, Beijing 100871, China
2. School of Software and Microelectronics at Wuxi, Peking University, Wuxi, Jiangsu 214125, China
3. School of Electronics and Information, Tongji University, Shanghai 200092, China

Received:1900-01-01 Revised:1900-01-01 Online:2011-04-01 Published:2011-04-01

摘要/Abstract

摘要： 对面向服务的多租户数据库上的Skyline查询展开了深入研究, 提出了一个有效的查询处理算法——面向多租户数据库的Skyline(multi-tenant database oriented Skyline, MDOS)。针对多租户数据库环境下, 数据往往以枢轴表形式存贮的特点, 设计了一个基于B+树的索引阵列。基于该索引结构, 进一步采用启发式剪枝策略, 极大地降低了支配测试的次数。大量的实验表明, MDOS算法具有较高的综合性能。

关键词: 多租户数据库系统, 枢轴表, Skyline计算, 索引阵列, 剪枝技术

Abstract: This paper studies the problem of Skyline computation within multi-tenant database system and proposes an effective algorithm, multi-tenant database oriented Skyline (MDOS). In multi-tenant database system, data are always stored in pivot table. A pivot table oriented index array based on B+-tree is developed. Based on this index structure, a set of heuristic pruning rules is used, which greatly reduces the times of domination test. Massive experiments demonstrate that MDOS is efficient and is of high overall performance.

Key words: multi-tenant database system, pivot table, Skyline computation, index array, pruning techniques

孙圣力1,2 , 黄震华3 , 李鹏1,2 . 面向多租户数据库的Skyline处理算法[J]. 计算机科学与探索, 2011, 5(4): 289-304.

SUN Shengli, HUANG Zhenhua, LI Peng. Skyline Computation over Multi-tenant Database System[J]. Journal of Frontiers of Computer Science and Technology, 2011, 5(4): 289-304.