Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Think big with big data: identifying suitable big data strategies in corporate environments
Ebner K., Bühnen T., Urbach N.  HICSS 2014 (Proceedings of the 47th Annual Hawaii International Conference on System Sciences, Waikoloa Village, HI, Jan 6-9, 2014)3748-3757.2014.Type:Proceedings
Date Reviewed: Sep 11 2014

While “no insight without analysis” is even truer for big data, organizations today still face the challenge of identifying an adequate technical architecture for achieving that. For this task, in the case of traditional data routinely solved through the deployment of relational database management systems (RDBMS), the authors convincingly derive a compelling, easy to use, and simple contingency matrix.

Based on an analysis of the (actually quite limited) scientific literature, the paper first identifies four different big data strategies: using traditional RDBMS simply with larger datasets; resorting to big data analytics as a service (cloud based); deploying MapReduce algorithms on a distributed file system; and a hybrid approach combining RDBMS with MapReduce.

Next, eight factors are derived, capturing different contingencies relevant for organizations when choosing their individual big data strategy (for example, relevance of big data analytics, urgency, resource availability, absorption capacity, data privacy, and others).

Mapping the impact of the eight contingency factors onto each of the four big data strategies finally produces the 8×4 contingency matrix.

The authors thoroughly describe all elements of the contingency matrix and also present vivid and differentiated examples of its entries. For instance, manufacturing companies should possibly look to a RDBMS-based approach (frequent and fast execution of standardized queries on less frequently changing data), while retailers might find a MapReduce strategy better suited to their needs (high urgency, frequently changing data). This allows the interested reader to easily fine tune the matrix to her individual needs, thus supporting a differentiated stakeholder discussion regarding available big data strategy options.

The paper is well written and easy to follow, and a must-read for data analysts and anyone in a professional or academic setting who searches for methods on how to determine strategies for coping with big data.

Reviewer:  Christoph F. Strnadl Review #: CR142709 (1412-1059)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Distributed Data Structures (E.1 ... )
 
 
Data Mining (H.2.8 ... )
 
 
Distributed Databases (H.2.4 ... )
 
 
Parallel Databases (H.2.4 ... )
 
 
Relational Databases (H.2.4 ... )
 
 
Statistical Databases (H.2.8 ... )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Distributed Data Structures": Date
Making data structures confluently persistent
Fiat A., Kaplan H. Journal of Algorithms 48(1): 16-58, 2003. Type: Article
Aug 5 2004
LH*RS--a highly-available scalable distributed data structure
Litwin W., Moussa R., Schwarz T. ACM Transactions on Database Systems 30(3): 769-811, 2005. Type: Article
Jan 19 2006
Skip graphs
Aspnes J., Shah G. ACM Transactions on Algorithms 3(4): 37-es, 2007. Type: Article
Apr 16 2008
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy