中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/102853
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81670765      Online Users : 2334
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/102853


    Title: Balancing the load of BI queries in a cloud computing environment
    Authors: 許秉瑜;Chung, Chen-Yao;Hsu, Ping-Yu;Wu, Chuan-Sheng;Lu, Ruei-Shan;Ting, Ping-Ho
    Contributors: 管理學院企業管理學系
    Keywords: Allocations;Balancing;Business;Cloud computing;Computation;Mathematical models;Queries;Storage capacity
    Date: 2014-02-18
    Issue Date: 2026-04-23 11:18:08 (UTC+8)
    Publisher: Taiwan Academic Network Management Committee;台灣軟體模擬學會 & Ainosco Press
    Abstract: 摘要: One of the most published programming models of cloud computing is MapReduce. Google MapReduce and Apache Hadoop MapReduce are various implementations of the model. On the other hand, with the rapid increase of data accumulated by organizations, Business Intelligence systems (BI) are implemented to support decision-making. BI queries sporadically require a huge amount of computation and storage capacity. This makes it a suitable candidate for the application of cloud computing. However, to the best of our knowledge, there have been no academic works devoted to the study of the issues of distributing BI data and operators to take advantage of MapReduce computation power. The research proposes a Greedy Allocation approach to resolve the issue. To demonstrate the feasibility of the proposed method, several BI queries designed in Business Content of SAP BIW module of ECC6.0 are used. The result reveals that the proposed method can find an effective plan in reasonable time compared to more exhaustive method.
    出版者: 台灣軟體模擬學會 & Ainosco Press
    出版日期: 2014-01-01
    出處: Journal of Internet Technology, 2014-01, Vol.15 (1), p.87-101
    資源來源: 中文電子期刊服務 CEPS: Chinese Electronic Periodical Services
    識別號: ISSN: 1607-9264
    識別號: DOI: 10.6138/JIT.2014.15.1.09
    Appears in Collections:[Department of Business Administration ] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML14View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明