Searching Algorithm in a nonrelational database

The problem of the data growth and it is storing to the nonrelational data-bases is related to their decreasing efficiency of searching. Nowadays, a very popular database in memory will help us with decreasing the efficiency of the operation searching in this paper. This paper examines the data search-ing in applications hosted in cloud service Amazon with using of nonrela-tional database DynamoDB. It develops new procedures to provide faster response to user and to obtain the data using of nonrelational database Dy-namoDB, that will provide the demanded data and subsequently, it will transfer them to the memory. The given procedure is based on two methods. The first method is a recognition of values, to which the user refers and the provision of this data to the database in memory. The second method is re-lated to the automatic storing of the data transferred to the database in memory. We perform various experiments in the paper, which are showing us a border of efficiency respectively inefficiency from a time perspective.