政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111269
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 109927/140876 (78%)
造访人次 : 45980312      在线人数 : 942
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 >  Item 140.119/111269


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/111269


    题名: MapReduce skyline query processing with partitioning and distributed dominance tests
    作者: Koh, Jia-Ling;Chen, Chia-Ching;Chan, Chih-Yu;Chen, Arbee L.P.
    陳家慶
    贡献者: 資科系
    关键词: Cloud computing;Indexing (of information);Testing;Dominance relationships;Grid partitioning;Map-reduce;Mapreduce frameworks;Parallel processing;Partitioning methods;Skyline query;Skyline query processing;Query processing
    日期: 2017
    上传时间: 2017-07-20 15:28:07 (UTC+8)
    摘要: In this paper, in order to efficiently process skyline queries by the MapReduce framework, two algorithms are proposed to prevent the bottleneck of centrally finding the global skyline from the local skylines. The proposed algorithms aim to reduce the number of dominance tests, which check whether a data point is dominated by another data point, and perform the necessary dominance tests in parallel. The first algorithm uses a grid-based and an angle-based partitioning schemes to divide the data space into segments for finding the local skyline data points. Two sets of rules are designed respectively for the two partitioning methods to reduce the number of dominance tests among the local skyline data points to find the skyline data points. The second algorithm uses the skyline data points discovered from sample data points to filter out most non-skyline data points in the mappers. For the remaining data points, the dominance relationship between the grid-partitioning segments is used to further reduce the number of dominance tests performed in both the mapper and the reducer. The experiment results show that the proposed two algorithms have significant improvement on response time compared with the related works. © 2016
    關聯: Information Sciences, 375, 114-137
    数据类型: article
    DOI 連結: http://dx.doi.org/10.1016/j.ins.2016.09.046
    DOI: 10.1016/j.ins.2016.09.046
    显示于类别:[資訊科學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    114.pdf2687KbAdobe PDF2435检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈