Processing constrainedK closest pairs query in spatial databases

DOI10.1007/BF02836661MaRDI QIDQ5492512zbMATH OpenFDO

Authors Yunsheng Liu, Yingyuan Xiao, Xiaofeng Liu

Publication date 13 October 2006

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02836661

zbMATH Keywords

\(R\)-treequery processing

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A new plane-sweep algorithm for the K-closest-pairs query
• scientific article; zbMATH DE number 1832331
• Nearest Neighbor Search
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
• scientific article; zbMATH DE number 1832328

Cited in

(5)

• A new plane-sweep algorithm for the K-closest-pairs query
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
• scientific article; zbMATH DE number 1832328 (Why is no real title available?)
• scientific article; zbMATH DE number 1832331 (Why is no real title available?)
• scientific article; zbMATH DE number 1875351 (Why is no real title available?)

This page was built for publication: Processing constrainedK closest pairs query in spatial databases

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