A Novel and Efficient Approach to Retrieve Data from Cloud

Authors

  • Pankaj Lathar Dept. of Computer Science & Engineering, University Institute of Engineering & Technology, M.D. University, Rohtak-124001 2 Dept. of Computer Science & Engineering, University Institute of Engineering & Technology,
  • Yudhvir Singh Dept. of Computer Science & Engineering, University Institute of Engineering & Technology, M.D. University,Rohtak-
  • Girish Kumar Sharma Dept. of Computer Science, Bhai Parmanand Institute of Business Studies, Shakarpur, Delhi-110092.(Govt. of NCT Delhi)

Keywords:

Algorithm, Complexity, Matrix, Pattern Matching, Strings

Abstract

String matching is a very important subject in the wider domain of text processing. String matching algorithms are basic components used in implementations of practical softwares existing under most operating systems. Moreover, they emphasize on programming methods that serve as paradigms in other fields of computer science. In Text processing systems users search a pattern of string from a given text. String matching is fundamental to database and text processing applications. Every text editor contains a mechanism to search the current document for arbitrary strings. This paper aims at describing a new string matching algorithm for various applications. A new algorithm has been designed which is based on a 2D structure.

References

Hume and Sunday (1991) [Fast String Searching] SOFTWARE�PRACTICE AND EXPERIENCE, VOL. 21(11), 1221-1248 (NOVEMBER 1991)

R. S. Boyer and J. S. Moore, A fast string searching algorithm, Carom. ACM 20, (10), 262-272 (1977).

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Chapter 32: String Matching, pp.906-932

Bretscher, Otto (2005), Linear Algebra with Applications (3rd ed.), Prentice Hall

Bronson, Richard (1989), Schaum`s outline of theory and problems of matrix operations, New York: McGraw�Hill, ISBN 978-0-07-007978-6

Brown, William A. (1991), Matrices and vector spaces, New York: M. Dekker, ISBN 978-0-8247-8419-5, Coburn, Nathaniel (1955), Vector and tensor analysis, New York: Macmillan, OCLC 1029828

http://en.wikipedia.org/wiki/Matrix_(mathematics)

D.S. Rajput, R.S. Thakur and G.S. Thakur, Clustering approach based on efficient coverage with minimum weight for document data, International Journal of Computer Sciences and Engineering (IJCSE), Vol. 1 Issue 1, pp 6-13, Sep-2013

Downloads

Published

2014-07-30

How to Cite

[1]
P. Lathar, Y. Singh, and G. K. Sharma, “A Novel and Efficient Approach to Retrieve Data from Cloud”, Int. J. Comp. Sci. Eng., vol. 2, no. 7, pp. 101–104, Jul. 2014.

Issue

Vol. 2 No. 7 (2014): IJCSE July Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.