STUDYING TECHNIQUES OF COMPUTATIONAL GEOMETRY FOR TWO-DIMENSION RANGE SEARCH ALGORITHM ASSISTING THE QUERY FOR DATABASE

Abstract

Nowadays, the rapid development of science and technology leads to the creation of enormous multimedia databases. Therefore, optimizing database queries has much attention from communication research. At first sight it seems that databases have little to do with geometry. Nevertheless, queries about data in a database can be interpreted geometrically. To this end we transform records in a database into points in a multi-dimensional space, and we transform the queries about the records into queries on this set of points. This paper proposed an approach based on computational geometry techniques for building KD-trees, two-dimensional range search algorithm (search KD trees algorithm) and general sets of points to improve the algorithm. The algorithm also applies to data query optimization, a problem that is still challenging today. Applying build KD-trees algorithm and search KD-trees algorithm to build a search application on two-dimensional range search shows the potential of this research for many real-world problems related to database query optimization.