Monitoring nearest neighbor queries with cache strategies

DOI10.1631/JZUS.2007.A0529zbMATH Open1130.68307OpenAlexW2008919872MaRDI QIDQ2644570FDOQ2644570

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

Recommendations

• scientific article; zbMATH DE number 1832323
• An efficient index structure for distributed \(k\)-nearest neighbours query processing
• scientific article; zbMATH DE number 1945886
• Processing \(k\) nearest neighbor queries in location-aware sensor networks
• scientific article; zbMATH DE number 1832331

zbMATH Keywords

\(K\)-nearest neighborscontinuous queryobject cachequery cache

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (4)

• Efficient evaluation of monitoring top-\(t\) most influential places
• An efficient index structure for distributed \(k\)-nearest neighbours query processing
• Title not available (Why is that?)
• 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)