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.
To overcomes the situation of ambiguity, in this paper Marginal Object Weight(MOW) is introduced to all nearest neighbor object for any respective query point, from there on most highly ranked object is identified as superseding nearest neighbor object. The performance of MOW ranking on nearest neighbor search is carried out for optimal amount of query point in the spatial databases of real and synthetic dataset. The superseding nearest neighbor object obtained with MOW ranking scheme identify more optimal to the query points compared to that of unranked superseding nearest neighbor object search scheme.
Keywords: Spatial Databases, Nearest Neighbor Search, Superseding, Marginal Object Weight
Download Full-Text
ABOUT THE AUTHORS
K. Balasaravanan
I received the M.E. degree in Computer Science and Engineering from Nandha Engineering college, Perundurai, Erode, Tamilnadu, India. He is pursuing the PhD degree in Anna University of Technology, Coimbatore,Tamilnadu,India. His research interests include Data warehousing, Data mining and Image mining
K. Duraiswamy
Professor, Dr.K.Duraiswamy, He is working as a Dean (Academic) at K.S.Rangasamy College of Technology, tiruchengode, Tamilnadu, India. His area of Specification is Computer Architecture and his research interests include in Computer Networks,VOIP, Internet Computing and security, Digital Image Processing, Computer Graphics, Data warehousing and Data mining. Dr.K.Duraiswamy has published many papers in refereed international and national journals and conferences proceedings.
K. Balasaravanan
I received the M.E. degree in Computer Science and Engineering from Nandha Engineering college, Perundurai, Erode, Tamilnadu, India. He is pursuing the PhD degree in Anna University of Technology, Coimbatore,Tamilnadu,India. His research interests include Data warehousing, Data mining and Image mining
K. Duraiswamy
Professor, Dr.K.Duraiswamy, He is working as a Dean (Academic) at K.S.Rangasamy College of Technology, tiruchengode, Tamilnadu, India. His area of Specification is Computer Architecture and his research interests include in Computer Networks,VOIP, Internet Computing and security, Digital Image Processing, Computer Graphics, Data warehousing and Data mining. Dr.K.Duraiswamy has published many papers in refereed international and national journals and conferences proceedings.
