Processing distance-based queries in multidimensional data spaces using R-trees

DOI10.1007/3-540-38076-0_1MaRDI QIDQ4415000zbMATH OpenFDO

Authors Antonio Corral, Joaquin Cañadas, Michael Vassilakopoulos

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2563/25630001.htm

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Nearest neighbor search. A database perspective.
• Search Space Reductions for Nearest-Neighbor Queries
• A model for k-nearest neighbor query processing cost in multidimensional data space
• Distributed processing of similarity queries
• A new plane-sweep algorithm for the K-closest-pairs query

Cited in

(7)

• MISTRAL: Processing relational queries using a multidimensional acces technique (Diss., TU München)
• Sequential and MapReduce-based algorithms for constructing an in-place multidimensional quad-tree index for answering fixed-radius nearest neighbor queries
• A new plane-sweep algorithm for the K-closest-pairs query
• A model for k-nearest neighbor query processing cost in multidimensional data space
• An efficient method to estimate the number of node accesses in R^*-trees for window queries
• The impact of buffering on closest pairs queries using R-trees
• BR-Tree: A Scalable Prototype for Supporting Multiple Queries of Multidimensional Data

This page was built for publication: Processing distance-based queries in multidimensional data spaces using R-trees

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