An Incremental Approach to Closest Pair Queries in Spatial Networks Using Best-First Search

An Incremental Approach to Closest Pair Queries in Spatial Networks Using Best-First Search

This paper addresses the problem of k Closest Pairs (kCP) query in spatial network databases. A Best-First search approach namely BFCP (Best-First Closest Pair) is proposed. Given two data sets of objects in a spatial network, BFCP first finds the 1st CP by computing the 1st NN (nearest neighbor) of...

Full description

Saved in:
Bibliographic Details
Main Authors: CHEN, Chunan, SUN, Weiwei, ZHENG, Baihua, Mao, Dingding, LIU, Weimo
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2011
Subjects:
Closest Pair
Spatial networks
Location-based services
Buffer management
Databases and Information Systems
Digital Communications and Networking
Online Access:https://ink.library.smu.edu.sg/sis_research/1411
http://dx.doi.org10.1007/978-3-642-23091-2_13
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/1411
http://dx.doi.org10.1007/978-3-642-23091-2_13

Similar Items