.png){kind=icon}
返回
Scalable skyline computation using a balanced pivot selection technique
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2013.05.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Skyline queries have recently received considerable attention as an alternative decision-making operator in the database community. The conventional skyline algorithms have primarily focused on optimizing the dominance of points in order to remove non-skyline points as efficiently as possible, but have neglected to take into account the incomparability of points in order to bypass unnecessary comparisons. To design a scalable skyline algorithm, we first analyze a cost model that copes with both dominance and incomparability, and develop a novel technique to select a cost-optimal point, called a pivot point, that minimizes the number of comparisons in point-based space partitioning. We then implement the proposed pivot point selection technique in the existing sorting- and partitioning-based algorithms. For point insertions/deletions, we also discuss how to maintain the current skyline using a skytree, derived from recursive point-based space partitioning. Furthermore, we design an efficient greedy algorithm for the k representative skyline using the skytree. Experimental results demonstrate that the proposed algorithms are significantly faster than the state-of-the-art algorithms. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Skyline
Dominance
Incomparability
Pivot point
Pivot point selection
Point-based space partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
暂无机构信息
引用论文
Ocular Surface Squamous Neoplasia Managed With Primary Interferon α2b: A Comparative Analysis of 212 Tumors in Smokers Versus Nonsmokers.png)
Cornea
CorneaIF0
PREAI
分享收藏
查看更多内容