An incremental approach to closest pair queries in spatial networks using best-first search

Authors:
Chunan Chen;Weiwei Sun;Baihua Zheng;Dingding Mao;Weimo Liu
Affiliations:
School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China;Singapore Management University;School of Computer Science, Fudan University, Shanghai, China;School of Computer Science, Fudan University, Shanghai, China
Venue:
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Year:
2011

Citing 15
Cited 0

Principles of database buffer management

ACM Transactions on Database Systems (TODS)
The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Closest pair queries in spatial databases

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations

IEEE Transactions on Knowledge and Data Engineering
A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Global Page Replacement in Spatial Databases

DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

Geoinformatica
Continuous nearest neighbor monitoring in road networks

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Distance join queries on spatial networks

GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Distance Oracles for Spatial Networks

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Path oracles for spatial networks

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 each object in the set with smaller cardinality. Then BFCP retrieves the 2nd , 3rd , ... , kth CP in an incremental way by searching the next NN of the currently found CP's source point. Furthermore, a novel buffer replacement policy called MDU (Minimum Distance Unit) is proposed to reduce I/O cost of BFCP. Unlike LRU, which records only the last reference time, the MDU policy considers both temporal locality and spatial locality when selecting a buffer page as the victim. A comprehensive experimental study is conducted to demonstrate the advantage of BFCP and MDU.