Marginal Object Weight Ranking for Nearest Neighbor Search in Spatial Databases

Uncertainty prevails in spatial databases whose objects are defined as multidimensional probable density function. Identifying an object is tedious task in uncertain spatial databases. Recent work on searching objects and its closeness to other objects was presented as superseding nearest neighbor search technique. In superseding neighbor search, one of all other objects in the spatial database, which was more close to the querying point is called as superseding nearest neighbor object. However there are cases where no object was unavailable to supersede to all other nearest neighbor object, ambiguity arises.

Provided by: International Journal of Computer Science Issues Topic: Data Management Date Added: Nov 2011 Format: PDF

Find By Topic