Indexing encrypted data using B- Tree

Abstract

In the past of computing history, the concept of database has become popular to everyone. However, as the development of the world of human, data has been improving its performance as well, typically in digital form – called digital databases – that are been managed using database management systems, which can store database contents, allowing data creation and maintenance, searching and other access. Besides all of that, the database security is required very highly in all the system nowadays.

In this Thesis report, we have studied the index technology in detail with special emphasis on balanced tree structure as well as the encryption algorithms for database security in accessing and managing data.

Indexing is a technique for improving database performance. There are many types of index share the common property that they eliminate the need to examine every entry when running a query. Among them, the most popular method in research is searching the encrypted data by search the original value after encrypted. However, this method cannot search a field of data in which all the value bigger than 60 (>60). Therefore, to solve this problem, we have thought to improve another method that is searching using the original value and decrypt the encrypted data. However, this method has problem in its speed and can be improved by apply the balance tree. After improvement, our method can search the encrypted data faster than the original. Although it is still not a perfect method, in this improvement, it becomes one of the suitable methods of searching encrypted data.