Optimal Server Strategies for Big Data  
Author Syouji Nakamura


Co-Author(s) Xufeng Zhao; Toshio Nakagawa


Abstract This paper considers an optimization problem of database management for Big data in server systems. The classification of three hierarchies for data storage are observed and modeled. To save the total expected cost of scanning and movement for the Big data, we suppose scanning occurs at a non-homogeneous Poisson process and related costs for scanning and movement are given. We obtain the expected cost rates, where number N of scans and movement interval time T are optimized. Finally, numerical examples are given.


Keywords Stochastic model, Database management, Big data, Optimal policy
    Article #:  2075
Proceedings of the 20th ISSAT International Conference on Reliability and Quality in Design
August 7-9, 2014 - Seattle, Washington, U.S.A.