• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Nianbin, Song Yibo, Yao Nianmin, Liu Daxin. A Parallel Data Processing Middleware Based on Clusters[J]. Journal of Computer Research and Development, 2007, 44(10): 1702-1708.
Citation: Wang Nianbin, Song Yibo, Yao Nianmin, Liu Daxin. A Parallel Data Processing Middleware Based on Clusters[J]. Journal of Computer Research and Development, 2007, 44(10): 1702-1708.

A Parallel Data Processing Middleware Based on Clusters

More Information
  • Published Date: October 14, 2007
  • Urgent performance requirements in large scale database applications have led to the use of parallelism for database processing. In this situation, providing a method to manipulate data paralleling can greatly improve the efficiency of data process. The HPDPM system is a middleware system applied in shared nothing cluster architecture to allow the database system to take advantage of the performance of parallel shared nothing systems. Presenting a new method to use parallel data processing middleware instead of parallel database system provides the ability for high performance computing. A framework is given for realizing parallel data manipulation. The primary modules of the middleware are described. Key techniques, used to improve system performance, including data placement and semantic caching, are discussed in detail. Then, the work principles and work steps of the middleware are presented. Implementation and experiments of this study show that this approach can improve system performance efficiently, enhance system availability and maintainability, and gain high performance price ratio. At present, the middleware system which uses data placement strategies and semantic caching have been applied to some large national engineering projects whose capacity of data is a little more than 1000 gigabytes.
  • Related Articles

    [1]Jiang Luyu, Ouyang Dantong, Zhang Qi, Tai Ran, Zhang Liming. Incremental Information Interaction-Based Algorithm for Enumerating MUSes[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440326
    [2]Bai Tian, Xiao Mingyu. Computational Complexity of Feedback Set and Subset Feedback Set Problems: A Survey[J]. Journal of Computer Research and Development, 2025, 62(1): 104-118. DOI: 10.7544/issn1000-1239.202330693
    [3]Ouyang Dantong, Jia Fengyu, Liu Siguang, Zhang Liming. An Algorithm Based on Extension Rule For Solving #SAT Using Complementary Degree[J]. Journal of Computer Research and Development, 2016, 53(7): 1596-1604. DOI: 10.7544/issn1000-1239.2016.20150032
    [4]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [5]Qiu Jiangtao, Tang Changjie, Zeng Tao, Liu Yintian. Strategy of Revising Rules for Association Text Classification[J]. Journal of Computer Research and Development, 2009, 46(4): 683-688.
    [6]Zhong Yong, Qin Xiaolin, and Bao Lei. An Association Rule Mining Algorithm of Multidimensional Sets[J]. Journal of Computer Research and Development, 2006, 43(12): 2117-2123.
    [7]Xiong Zhongmin, Hao Zhongxiao. An Approach to Termination Decision for a Rule Set Based on Activation Path and Conditional Formula[J]. Journal of Computer Research and Development, 2006, 43(5): 901-907.
    [8]Hao Zhongxiao, Xiong Zhongmin. An Efficient Algorithm for Computing an Irreducible Rule Set in Active Database[J]. Journal of Computer Research and Development, 2006, 43(2): 281-287.
    [9]Hao Zhongxiao, Ren Chao, Zhao Lingqiang. Termination Analysis of Active Rule Based on Dependency Set[J]. Journal of Computer Research and Development, 2005, 42(12): 2199-2205.
    [10]Tian Daxin, Liu Yanheng, Li Yongli, Tang Yi. A Fast Matching Algorithm and Conflict Detection for Packet Filter Rules[J]. Journal of Computer Research and Development, 2005, 42(7): 1128-1135.

Catalog

    Article views (595) PDF downloads (517) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return