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...
Saved in:
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: | |
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 |
Similar Items
-
Closest pairs search over data stream
by: ZHU, Rui Zhu, et al.
Published: (2024) -
Fast Optimal Aggregate Point Search for a Merged Set on Road Networks
by: SUN, Weiwei, et al.
Published: (2015) -
ROAD: A New Spatial Object Search Framework for Road Networks
by: LEE, Ken C. K., et al.
Published: (2012) -
Anonymous Query Processing in Road Networks
by: MOURATIDIS, Kyriakos, et al.
Published: (2010) -
Efficient collective spatial keyword query processing on road networks
by: GAO, Yunjun, et al.
Published: (2016)