Skip to main content

Introducing a Novel Data Management Approach for Distributed Large Scale Data Processing in Future Computer Clouds

  • Conference paper
Neural Information Processing (ICONIP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7063))

Included in the following conference series:

  • 2572 Accesses

Abstract

Deployment of pattern recognition applications for large-scale data sets is an open issue that needs to be addressed. In this paper, an attempt is made to explore new methods of partitioning and distributing data, that is, resource virtualization in the cloud by fundamentally re-thinking the way in which future data management models will need to be developed on the Internet. The work presented here will incorporate content-addressable memory into Cloud data processing to entail a large number of loosely-coupled parallel operations resulting in vastly improved performance. Using a lightweight associative memory algorithm known as Distributed Hierarchical Graph Neuron (DHGN), data retrieval/processing can be modeled as pattern recognition/matching problem, conducted across multiple records and data segments within a single-cycle, utilizing a parallel approach. The proposed model envisions a distributed data management scheme for large-scale data processing and database updating that is capable of providing scalable real-time recognition and processing with high accuracy while being able to maintain low computational cost in its function.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters, In: Proceedings of 6th Conference on Operating Systems Design & Implementation (2004)

    Google Scholar 

  2. Hadoop, http://lucene.apache.org/hadoop

  3. Shiers, J.: Grid today, clouds on the horizon. Computer Physics, 559–563 (2009)

    Google Scholar 

  4. Abadi, D.J.: Data Management in the Cloud: Limitations and Opportunities. Bulletin of the Technical Committee on Data Engineering, 3–12 (2009)

    Google Scholar 

  5. Szalay, A., Bunn, A., Gray, J., Foster, I., Raicu, I.: The Importance of Data Locality in Distributed Computing Applications, In: Proc. of the NSF Workflow Workshop (2006)

    Google Scholar 

  6. Chisvin, L., Duckworth, J.R.: Content-addressable and associative memory: alternatives to the ubiquitous RAM. IEEE Computer 22, 51–64 (1989)

    Article  Google Scholar 

  7. Hopfield, J.J., Tank, D.W.: Neural Computation of Decisions in Optimization Problems. Biological Cybernetics 52, 141–152 (1985)

    MathSciNet  MATH  Google Scholar 

  8. Kosko, B.: Bidirectional Associative Memories. IEEE Transactions on Systems and Cybernetics 18, 49–60 (1988)

    Article  MathSciNet  Google Scholar 

  9. Kosko, B.: Neural Networks and Fuzzy Systems: A Dynamical Systems Approach to Machine Intelligence. Prentice-Hall, NJ (1992)

    MATH  Google Scholar 

  10. Luo, B., Hancock, E.R.: Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans. Pattern Anal. Machine Intelligence 23(10), 1120–1136 (2001)

    Article  Google Scholar 

  11. Irniger, C., Bunke, H.: Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 118–129. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

    Google Scholar 

  13. Ohkuma, K.: A Hierarchical Associative Memory Consisting of Multi-Layer Associative Modules. In: Proc. of 1993 International Joint Conference on Neural Networks (IJCNN 1993), Nagoya, Japan (1993)

    Google Scholar 

  14. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large Clusters. Communications of the ACM, 107–113 (2008)

    Google Scholar 

  15. Khan, A.I., Mihailescu, P.: Parallel Pattern Recognition Computations within a Wireless Sensor Network. In: Proceedings of the 17th International Conference on Pattern Recognition. IEEE Computer Society, Cambridge (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Basirat, A.H., Khan, A.I. (2011). Introducing a Novel Data Management Approach for Distributed Large Scale Data Processing in Future Computer Clouds. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24958-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24958-7_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24957-0

  • Online ISBN: 978-3-642-24958-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics