Cited by 1,099Big Data Technologies and ApplicationsCloud Computing and Resource ManagementAdvanced Database Systems and Queries

Toward Scalable Systems for Big Data Analytics: A Technology Tutorial

Open access
Hu, Han, Wen, Yonggang, Chua, Tat-Seng, Li, Xuelong·2014·IEEE Access

Abstract

Recent technological advancements have led to a deluge of data from distinctive domains (e.g., health care and scientific sensors, user-generated data, Internet and financial companies, and supply chain systems) over the past two decades. The term big data was coined to capture the meaning of this emerging trend. In addition to its sheer volume, big data also exhibits other unique characteristics as compared with traditional data. For instance, big data is commonly unstructured and require more real-time analysis. This development calls for new system architectures for data acquisition, transmission, storage, and large-scale data processing mechanisms. In this paper, we present a literature survey and system tutorial for big data analytics platforms, aiming to provide an overall picture for nonexpert readers and instill a do-it-yourself spirit for advanced audiences to customize their own big-data solutions. First, we present the definition of big data and discuss big data challenges. Next, we present a systematic framework to decompose big data systems into four sequential modules, namely data generation, data acquisition, data storage, and data analytics. These four modules form a big data value chain. Following that, we present a detailed survey of numerous approaches and mechanisms from research and industry communities. In addition, we present the prevalent Hadoop framework for addressing big data challenges. Finally, we outline several evaluation benchmarks and potential research directions for big data systems.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2014.2332453

Cites

221 of 221 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Traditional batch-based monitoring approaches often fall short in addressing the dynamic nature of data pipelines and the need for real-time insights.

    “Traditional batch-based monitoring approaches often fall short in addressing the dynamic nature of data pipelines and the need for real-time insights [3].”

    From Real-Time Monitoring of Data Pipelines: Exploring and Experimentally Proving that the Continuous Monitoring in Data Pipelines Reduces Cost and Elevates Quality (2024) · cites this paper as [3]

    The “Future Research” section (page not provided) says mature batch-processing paradigms struggle with growing data volumes and substantial real-time requirements. The “Streaming vs. Batch” section describes streaming as suited to rapidly arriving data, but the paper does not specifically assess batch-based monitoring of data pipelines. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 41

  1. J. Gantz and D. Reinsel, ''Extracting value from chaos,'' in Proc. IDC iView, 2011, pp. 1-12.
  2. O. R. Team, Big Data Now: Current Perspectives from O'Reilly Radar. Sebastopol, CA, USA: O'Reilly Media, 2011.
  3. S. Marche, ''Is Facebook making us lonely,'' Atlantic, vol. 309, no. 4, pp. 60-69, 2012.
  4. K. Goodhope et al., ''Building linkedins real-time activity data pipeline,'' Data Eng., vol. 35, no. 2, pp. 33-45, 2012.
  5. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, ''Dryad: Distributed data-parallel programs from sequential building blocks,'' in Proc. 2nd ACM SIGOPS/EuroSys Eur. Conf. Comput. Syst., Jun. 2007, pp. 59-72.
  6. G. Malewicz et al., ''Pregel: A system for large-scale graph processing,'' in Proc. ACM SIGMOD Int. Conf. Manag. Data, Jun. 2010, pp. 135-146.
  7. S. Melnik et al., ''Dremel: Interactive analysis of web-scale datasets,'' Proc. VLDB Endowment, vol. 3, nos. 1-2, pp. 330-339, 2010.
  8. J. Gantz and D. Reinsel, ''The digital universe decade-are you ready,'' in Proc. White Paper, IDC, 2010.
  9. L. Selavo et al., ''Luster: Wireless sensor network for environmental research,'' in Proc. 5th Int. Conf. Embedded Netw. Sensor Syst., Nov. 2007, pp. 103-116.
  10. Y. Kim, T. Schmid, Z. M. Charbiwala, J. Friedman, and M. B. Srivastava, ''Nawms: Nonintrusive autonomous water monitoring system,'' in Proc. 6th ACM Conf. Embedded Netw. Sensor Syst., Nov. 2008, pp. 309-322.
  11. A. Greenberg et al., ''VL2: A scalable and flexible data center network,'' in Proc. ACM SIGCOMM Conf. Data Commun., 2009, pp. 51-62.
  12. C. Guo et al., ''BCube: A high performance, server-centric network archi- tecture for modular data centers,'' SIGCOMM Comput. Commun. Rev., vol. 39, no. 4, pp. 63-74, 2009.
  13. N. Farrington et al., ''Helios: A hybrid electrical/optical switch architec- ture for modular data centers,'' in Proc. ACM SIGCOMM Conf., 2010, pp. 339-350.
  14. G. Wang et al., ''c-through: Part-time optics in data centers,'' SIGCOMM Comput. Commun. Rev., vol. 41, no. 4, pp. 327-338, 2010.
  15. X. Ye, Y. Yin, S. B. Yoo, P. Mejia, R. Proietti, and V. Akella, ''DOS- A scalable optical switch for datacenters,'' in Proc. 6th ACM/IEEE Symp. Archit. Netw. Commun. Syst., Oct. 2010, pp. 1-12.
  16. A. Singla, A. Singh, K. Ramachandran, L. Xu, and Y. Zhang, ''Proteus: A topology malleable data center network,'' in Proc. 9th ACM SIGCOMM Workshop Hot Topics Netw., 2010, pp. 801-806.
  17. A. Silberschatz, H. F. Korth, and S. Sudarshan, Database System Con- cepts, vol. 4. New York, NY, USA: McGraw-Hill, 1997.
  18. D. Salomon, Data Compression. New York, NY, USA: Springer-Verlag, 2004.
  19. J. Bleiholder and F. Naumann, ''Data fusion,'' ACM Comput. Surv., vol. 41, no. 1, pp. 1-41, 2009.
  20. R. Chaiken et al., ''Scope: Easy and efficient parallel process- ing of massive data sets,'' Proc. VLDB Endowment, vol. 1, no. 2, pp. 1265-1276, 2008.
  21. F. Chang et al., ''Bigtable: A distributed storage system for structured data,'' ACM Trans. Comput. Syst., vol. 26, no. 2, pp. 4:1-4:26, Jun. 2008.
  22. A. Lakshman and P. Malik, ''Cassandra: Structured storage system on a p2p network,'' in Proc. 28th ACM Symp. Principles Distrib. Comput., 2009, p. 5. [149(2013). HBase [Online]. Available: http://hbase.apache.org/ [150] (2013). Hypertable [Online]. Available: http://hypertable.org/
  23. B. F. Cooper et al., ''PNUTS: Yahoo!'s hosted data serving platform,'' in Proc. VLDB Endowment, vol. 1, no. 2, pp. 1277-1288, 2008.
  24. J. Shute et al., ''F1: The fault-tolerant distributed RDBMS support- ing Google's ad business,'' in Proc. Int. Conf. Manag. Data, 2012, pp. 777-778.
  25. K. Keeton, C. B. Morrey, III, C. A. Soules, and A. Veitch, ''Lazybase: Freshness vs. performance in information management,'' SIGOPS Oper. Syst. Rev., vol. 44, no. 1, pp. 15-19, Jan. 2010.
  26. D. W. Walker and J. J. Dongarra, ''MPI: A standard message passing interface,'' Supercomputer, vol. 12, pp. 56-68, 1996.
  27. A. Thusoo et al., ''Hive: A warehousing solution over a Map-Reduce framework,'' Proc. VLDB Endowment, vol. 2, no. 2, pp. 1626-1629, 2009.
  28. Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst, ''HaLoop: Efficient iterative data processing on large clusters,'' Proc. VLDB Endowment, vol. 3, nos. 1-2, pp. 285-296, 2010.
  29. J. Ekanayake et al., ''Twister: A runtime for iterative mapreduce,'' in Proc. 19th ACM Int. Symp. High Perform. Distrib. Comput., 2010, pp. 810-818.
  30. P. Bhatotia, A. Wieder, R. Rodrigues, U. A. Acar, and R. Pasquin, ''Incoop: Mapreduce for incremental computations,'' in Proc. 2nd ACM Symp. Cloud Comput., 2011, pp. 1-14.
  31. C. Olston et al., ''Nova: Continuous Pig/hadoop workflows,'' in Proc. Int. Conf. Manag. Data, 2011, pp. 1081-1090.
  32. G. Salton, ''Automatic text processing,'' Science, vol. 168, no. 3929, pp. 335-343, 1970.
  33. S. Shridhar, M. Lakhanpuria, A. Charak, A. Gupta, and S. Shridhar, ''Snair: A framework for personalised recommendations based on social network analysis,'' in Proc. 5th Int. Workshop Location-Based Soc. Netw., 2012, pp. 55-61.
  34. S. Maniu and B. Cautis, ''Taagle: Efficient, personalized search in collaborative tagging networks,'' in Proc. Assoc. Comput. Mach. (ACM) SIGMOD Int. Conf. Manag. Data, 2012, pp. 661-664.
  35. H. Hu, Y. Wen, H. Luan, T.-S. Chua, and X. Li, ''Towards multi-screen social tv with geo-aware social sense,'' IEEE Multimedia, to be published.
  36. Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst, ''Haloop: Efficient iterative data processing on large clusters,'' Proc. VLDB Endowment, vol. 3, nos. 1-2, pp. 285-296, 2010.
  37. J. Ekanayake et al., ''Twister: A runtime for iterative mapreduce,'' in Proc. 19th Assoc. Comput. Mach. (ACM) Int. Symp. High Perform. Distrib. Comput., 2010, pp. 810-818.
  38. J. Dittrich, J.-A. Quiané-Ruiz, A. Jindal, Y. Kargin, V. Setty, and J. Schad, ''Hadoop++: Making a yellow elephant run like a cheetah (without it even noticing),'' Proc. VLDB Endowment, vol. 3, nos. 1-2, pp. 515-529, 2010.
  39. M. Yong, N. Garegrat, and S. Mohan, ''Towards a resource aware scheduler in Hadoop,'' in Proc. Int. Conf. Web Services (ICWS), 2009, pp. 102-109.
  40. S. Patil et al., ''Ycsb++: Benchmarking and performance debugging advanced features in scalable table stores,'' in Proc. 2nd Assoc. Comput. Mach. (ACM) Symp. Cloud Comput., 2011, p. 9.
  41. A. Ghazal et al., ''Bigbench: Towards an industry standard benchmark for big data analytics,'' Proc. Assoc. Comput. Mach. (ACM) SIGMOD Int. Conf. Manag. Data, 2013, pp. 1197-1208.

Cited by

Sorted by citations

Authors
Hu, H., Wen, Y., Chua, T.-S., & Li, X.
Affiliations
  • National University of Singapore (SG)
  • Nanyang Technological University (SG)
  • Chinese Academy of Sciences (CN)
Venue
IEEE Access
Published
2014
Volume
2
Pages
652-687
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2157954477
Cited by
1,099
References
221
Citations by year
2026: 17 · 2025: 48 · 2024: 47 · 2023: 50 · 2022: 69 · 2021: 100 · 2020: 133 · 2019: 123 · 2018: 143 · 2017: 130 · 2016: 132 · 2015: 97 · 2014: 9 · 2012: 1
FWCI
229.10
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Institutional Repository of Xi'an Institute of Optics and Fine Mechanics, Chinese Academy of Sciences (Xian Institute of Optics and Precision Mechanics) (submittedVersion, cc-by-nc-sa)
Funders
  • Energy Market Authority of Singapore (NRF2012EWT-EIRP002-013)
  • Singapore National Research Foundation through the International Research Center at Singapore Funding Initiative and administered by the IDM Programme Office
  • National Natural Science Foundation of China (61125106)
Topics
  • Social Sciences › Decision Sciences › Information Systems and Management › Big Data Technologies and Applications
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
Keywords
big data analytics, big data systems, data acquisition, data storage, Hadoop, scalable data processing, unstructured data, real-time analytics, big data challenges

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review