In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Research in modeling and querying spatial data has primarily focused on traditional "crisp" spatial objects with exact location and spatial extent. More recent work, how...
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...