Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

We have seen the use of partition trees for range searching earlier. In this lecture an efficient partition scheme which achieves the optimal query time within polylog factors is described. See [4] and [5] for more details. There are several new ideas on which this scheme relies. The existence of “good” cuttings are central to the algorithm. In the next section some of the definitions and resul...

Give us 5 minutes and we will show you the best book to read today. This is it, the handbook of exact string matching algorithms that will be your best choice for better reading book. Your five times will not spend wasted by reading this website. You can take the book as a source to make better concept. Referring the books that can be situated with your needs is sometime difficult. But here, th...

The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the text T . Currently, the fastest algorithms for this problem are the following. The Galil–Giancarlo algorithm finds all locations where the pattern has at most k errors (where k is part of the input) in time O(nk). The Abrahamson algorithm fi...

Various string matching algorithms have been designed and some experimental works on string matching over bounded alphabets have been performed but string matching over unbounded alphabets has been little investigated. We present here experimental results where symbols are taken among potentially innnite sets such as integers, reals or composed structures. These results show that in most cases ...