在多核处理器上高效地实现连续天际线计算

Kenichi Koizumi, M. Inaba, K. Hiraki
{"title":"在多核处理器上高效地实现连续天际线计算","authors":"Kenichi Koizumi, M. Inaba, K. Hiraki","doi":"10.1109/MEMCOD.2015.7340468","DOIUrl":null,"url":null,"abstract":"The skyline operator has been proposed as a method for extracting highly-utility samples from a large database. A set of the extracted samples is called `skyline'. The theme of the MEMOCODE 2015 Design Contest is to accelerate continuous skyline computation, skyline computing for a streaming dataset, on any platform. In this paper, we present our method that achieved the best performance in the contest. We describe our data structure, algorithms, and optimization methods for the contest reference code in the multi-core processor. We have accelerated our solution in the two aspects of efficient algorithms and code optimizations. The task of the contest is to compute the skyline at each time-step for 800,000 entries with a seven-dimensional vector value and the activation time and the deactivation time. We use one commodity computer and the average runtime of our solution is 407 milliseconds.","PeriodicalId":106851,"journal":{"name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Efficient implementation of continuous skyline computation on a multi-core processor\",\"authors\":\"Kenichi Koizumi, M. Inaba, K. Hiraki\",\"doi\":\"10.1109/MEMCOD.2015.7340468\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The skyline operator has been proposed as a method for extracting highly-utility samples from a large database. A set of the extracted samples is called `skyline'. The theme of the MEMOCODE 2015 Design Contest is to accelerate continuous skyline computation, skyline computing for a streaming dataset, on any platform. In this paper, we present our method that achieved the best performance in the contest. We describe our data structure, algorithms, and optimization methods for the contest reference code in the multi-core processor. We have accelerated our solution in the two aspects of efficient algorithms and code optimizations. The task of the contest is to compute the skyline at each time-step for 800,000 entries with a seven-dimensional vector value and the activation time and the deactivation time. We use one commodity computer and the average runtime of our solution is 407 milliseconds.\",\"PeriodicalId\":106851,\"journal\":{\"name\":\"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MEMCOD.2015.7340468\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEMCOD.2015.7340468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

天际线算子被提出作为一种从大型数据库中提取高效用样本的方法。一组提取的样本被称为“天际线”。MEMOCODE 2015设计竞赛的主题是在任何平台上加速连续的天际线计算,流数据集的天际线计算。在本文中,我们提出了在比赛中取得最佳表现的方法。我们描述了我们的数据结构,算法和优化方法的比赛参考代码在多核处理器。我们在高效算法和代码优化两个方面加速了我们的解决方案。比赛的任务是用一个七维向量值和激活时间和失效时间计算800,000个条目在每个时间步的天际线。我们使用一台普通计算机,解决方案的平均运行时间为407毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient implementation of continuous skyline computation on a multi-core processor
The skyline operator has been proposed as a method for extracting highly-utility samples from a large database. A set of the extracted samples is called `skyline'. The theme of the MEMOCODE 2015 Design Contest is to accelerate continuous skyline computation, skyline computing for a streaming dataset, on any platform. In this paper, we present our method that achieved the best performance in the contest. We describe our data structure, algorithms, and optimization methods for the contest reference code in the multi-core processor. We have accelerated our solution in the two aspects of efficient algorithms and code optimizations. The task of the contest is to compute the skyline at each time-step for 800,000 entries with a seven-dimensional vector value and the activation time and the deactivation time. We use one commodity computer and the average runtime of our solution is 407 milliseconds.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信