Space support in databases poses new challenges in every part of a database management
system & the capability of spatial support in the physical layer is considered very important …

Similarity join is a useful primitive operation underlying many applications, such as near
duplicate Web page detection, data integration, and pattern recognition. Traditional similarity …

This paper addresses the problem of finding the K closest pairs between two spatial
datasets (the so-called, K closest pairs query, K-CPQ), where each dataset is stored in an R …

Modern applications are both data and computationally intensive and require the storage
and manipulation of voluminous traditional (alphanumeric) and nontraditional data sets …

This volume was born from the experience of the authors as researchers and educators,
which suggests that many students of data mining are handicapped in their research by the …

Given a query point and a collection of spatial features, a multi-type nearest neighbor
(MTNN) query finds the shortest tour for the query point such that only one instance of each …

Spatial data management has been an active area of intensive research for more than two
decades. In order to support spatial objects in a database system several issues should be …

Background In recent years, the research on spatial indexing is arousing more and more
interests and attentions. A number of spatial indexing structures based on secondary …

This thesis addresses the problem of finding the K closest pairs between two spatial
datasets (the so-called, K Closest Pairs Query, K-CPQ), where each set is stored in an index …

In multimedia databases, the spatial index structures based on trees (like R-tree, M-tree)
have been proved to be efficient and scalable for low-dimensional data retrieval. However, if …