Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 147593, 12 pages
http://dx.doi.org/10.1155/2013/147593
Research Article

An Abstract Description Method of Map-Reduce-Merge Using Haskell

1College of Computer Science and Technology, Jilin University, Changchun 130012, China
2College of Mathematics, Jilin University, Changchun 130012, China

Received 17 May 2013; Accepted 17 July 2013

Academic Editor: William Guo

Copyright © 2013 Lei Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Communications of the ACM, vol. 51, no. 1, pp. 107–113, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. P. Wang, D. Meng, J. Zhan, and B. Tu, “Review of programming models for data-intensive computing,” Journal of Computer Research and Development, vol. 47, no. 11, pp. 1993–2002, 2010. View at Google Scholar · View at Scopus
  3. J.-J. Li, J. Cui, D. Wang, L. Yan, and Y.-S. Huang, “Survey of MapReduce parallel programming model,” Chinese Journal of Electronics, vol. 39, no. 11, pp. 2635–2642, 2011. View at Google Scholar · View at Scopus
  4. Y. Li, Y. Wang, and L. Bao, “FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search,” Mathematical Problems in Engineering, vol. 2012, Article ID 310328, 17 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  5. X. Wang, Y. Wang, and H. Zhu, “Energy-efficient multi-job scheduling model for cloud computing and its genetic algorithm,” Mathematical Problems in Engineering, vol. 2012, Article ID 589243, 16 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. H.-C. Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker, “Map-reduce-merge: simplified relational data processing on large clusters,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1029–1040, Beijing, China, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Wang, T. Wang, D. Yang, and H. Li, “A filter-based multi-join algorithm in cloud computing environment,” Journal of Computer Research and Development, vol. 48, supplement, pp. 245–253, 2011. View at Google Scholar
  8. R. Vernica, M. J. Carey, and C. Li, “Efficient parallel set-similarity joins using MapReduce,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 495–506, Indianapolis, Ind, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Jiang, A. K. H. Tung, and G. Chen, “MAP-JOIN-REDUCE: toward scalable and efficient data analysis on large clusters,” IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 9, pp. 1299–1311, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Okcan and M. Riedewald, “Processing theta-joins using MapReduce,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 949–960, Athens, Greece, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Blanas, J. M. Patel, V. Ercegovac, J. Rao, E. J. Shekita, and Y. Tian, “A comparison of join algorithms for log processing in MaPreduce,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 975–986, Indianapolis, Ind, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. X.-P. Qin, H.-J. Wang, X.-Y. Du, and S. Wang, “Big data analysis—competition and symbiosis of RDBMS and MapReduce,” Journal of Software, vol. 23, no. 1, pp. 32–45, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Wang, H.-J. Wang, X.-P. Qin, and X. Zhou, “Architecting big data: challenges, studies and forecasts,” Chinese Journal of Computers, vol. 34, no. 10, pp. 1741–1752, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. S.-L. Gui, L. Luo, Y. Li, M. Yu, and J.-H. Xu, “Schedulability analysis tool for distributed real-time systems based on automata theory,” Journal of Software, vol. 22, no. 6, pp. 1236–1251, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. Wang, M. Yin, and W. Gu, “Fuzzy multiset finite automata and their languages,” Soft Computing, vol. 17, no. 3, pp. 381–390, 2013. View at Publisher · View at Google Scholar
  16. X. Liu, L. Yang, M.-X. Pan, and L.-Z. Wang, “Scenario-driven service behavior manipulation,” Journal of Software, vol. 22, no. 6, pp. 1185–1198, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Gu, G. Li, and M. Yin, “Extending fuzzy soft sets with fuzzy description logics,” ICIC Express Letters, Part B, vol. 2, no. 5, pp. 1001–1007, 2011. View at Google Scholar · View at Scopus
  18. R. Lämmel, “Google's MapReduce programming model—revisited,” Science of Computer Programming, vol. 70, no. 1, pp. 1–30, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. R. Pike, S. Dorward, R. Griesemer, and S. Quinlan, “Interpreting the data: parallel analysis with Sawzall,” Scientific Programming, vol. 13, no. 4, pp. 277–298, 2005. View at Google Scholar · View at Scopus
  20. F. Palmieri, L. Buonanno, S. Venticinque, R. Aversa, and B. Di Martino, “A distributed scheduling framework based on selfish autonomous agents for federated cloud environments,” Future Generation Computer Systems, vol. 29, no. 6, pp. 1461–1472, 2013. View at Publisher · View at Google Scholar
  21. J. L. Lucas-Simarro, R. Moreno-Vozmediano, R. S. Montero, and I. M. Llorente, “Scheduling strategies for optimal service deployment across multiple clouds,” Future Generation Computer Systems, vol. 29, no. 6, pp. 1431–1441, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Cai and M. Yin, “On the utility of landmarks in SAT based planning,” Knowledge-Based Systems, vol. 36, pp. 146–154, 2012. View at Publisher · View at Google Scholar
  23. D. Cai, J. Sun, and M. Yin, “Conformant planning heuristics based on plan reuse in belief states,” in Proceedings of the 23rd AAAI Conference on Artificial Intelligence and the 20th Innovative Applications of Artificial Intelligence Conference, pp. 1780–1781, Chicago, Ill, USA, July 2008. View at Scopus
  24. C. Zhang and J. Sun, “An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem,” Expert Systems with Applications, vol. 36, no. 3, pp. 5162–5167, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. C. Zhang, J. Ning, and D. Ouyang, “A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem,” Computers and Industrial Engineering, vol. 58, no. 1, pp. 1–11, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. B. O'Sullivan, J. Goerzen, and E. Don Stewart, Real World Haskell, O'Reilly Media, 2008.
  27. F. Chang, J. Dean, S. Ghemawat et al., “Bigtable: a distributed storage system for structured data,” ACM Transactions on Computer Systems, vol. 26, no. 2, article 4, 2008. View at Publisher · View at Google Scholar · View at Scopus