Perfect Hashing Base R-tree for Multiple Queries

Abstract

Information retrieval and Data base management system are one of the important filed of computer science. Popularity of internet is increased, number of people use internet are increased daily. Information on the web and database of information are becoming larger and larger. Information retrieval and database management system both need efficient query processing for storing, deleting and retrieval of data (information). In the field of computer science efficient query processing on the large data is challenging task because data is in various form andthere are many types of data.Different type of data requires different type of query to process them. To store the data efficiently system need efficient data structure. So, there is a need of data structure that store data and process queries efficiently. Indexing structures are one of the data structures use for this purpose. Many indexing structure has been developed and used for the various application. But there is still need of improve that index structure for more efficient query processing. One of the major challenge is to support multiple query on the same index structure. In this thesis different index structures are discussed and one new index structure is proposed for the efficient point query and range processing on multidimensional data.This thesis comprise of 5 chapters,chapter 1 describes information retrieval, basic index structures and hashing technics. Chapter 2 describes various index structure and comparison between them. Chapter 3 specifies the problem statement, objective defined for this thesis and methodology to achieve these objectives. Chapter 4 describes new index structure and its performance. Chapter 5 concludes the overall thesis with overall observations and future work is highlighted.