Monitoring nearest neighbor queries with cache strategies

DOI10.1631/JZUS.2007.A0529MaRDI QIDQ2644570zbMATH OpenOpenAlexFDO

Authors Peng Pan, Yan-Sheng Lu

Publication date 3 September 2007

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1631/jzus.2007.a0529

zbMATH Keywords

\(K\)-nearest neighborscontinuous queryobject cachequery cache

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• K-nearest neighbor search for moving query point
• An efficient index structure for distributed \(k\)-nearest neighbours query processing
• Efficient evaluation of continuous range queries on moving objects
• Processing \(k\) nearest neighbor queries in location-aware sensor networks
• Constrained nearest neighbor queries

Cites work

• Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects

Cited in

(4)

• An efficient index structure for distributed \(k\)-nearest neighbours query processing
• K-nearest neighbor search for moving query point
• Efficient evaluation of monitoring top-\(t\) most influential places
• Continuous monitoring of reverse approximate nearest neighbour queries on road network

This page was built for publication: Monitoring nearest neighbor queries with cache strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644570)