Open Access   Article Go Back

A Novel and Efficient Approach to Retrieve Data from Cloud

P. Lathar1 , Y. Singh2 , G.K. Sharma3

Section:Research Paper, Product Type: Journal Paper
Volume-2 , Issue-7 , Page no. 101-104, Jul-2014

Online published on Jul 30, 2014

Copyright © P. Lathar, Y. Singh, G.K. Sharma . 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.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: P. Lathar, Y. Singh, G.K. Sharma , “A Novel and Efficient Approach to Retrieve Data from Cloud,” International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.101-104, 2014.

MLA Style Citation: P. Lathar, Y. Singh, G.K. Sharma "A Novel and Efficient Approach to Retrieve Data from Cloud." International Journal of Computer Sciences and Engineering 2.7 (2014): 101-104.

APA Style Citation: P. Lathar, Y. Singh, G.K. Sharma , (2014). A Novel and Efficient Approach to Retrieve Data from Cloud. International Journal of Computer Sciences and Engineering, 2(7), 101-104.

BibTex Style Citation:
@article{Lathar_2014,
author = {P. Lathar, Y. Singh, G.K. Sharma },
title = {A Novel and Efficient Approach to Retrieve Data from Cloud},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {7 2014},
volume = {2},
Issue = {7},
month = {7},
year = {2014},
issn = {2347-2693},
pages = {101-104},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=216},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=216
TI - A Novel and Efficient Approach to Retrieve Data from Cloud
T2 - International Journal of Computer Sciences and Engineering
AU - P. Lathar, Y. Singh, G.K. Sharma
PY - 2014
DA - 2014/07/30
PB - IJCSE, Indore, INDIA
SP - 101-104
IS - 7
VL - 2
SN - 2347-2693
ER -

VIEWS PDF XML
3439 3393 downloads 3531 downloads
  
  
           

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.

Key-Words / Index Term

Algorithm, Complexity, Matrix, Pattern Matching, Strings

References

[1]. Hume and Sunday (1991) [Fast String Searching] SOFTWARE�PRACTICE AND EXPERIENCE, VOL. 21(11), 1221�1248 (NOVEMBER 1991)
[2]. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Carom. ACM 20, (10), 262� 272 (1977).
[3]. 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
[4]. Bretscher, Otto (2005), Linear Algebra with Applications (3rd ed.), Prentice Hall
[5]. Bronson, Richard (1989), Schaum`s outline of theory and problems of matrix operations, New York: McGraw�Hill, ISBN 978-0-07-007978-6
[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
[7]. 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