Nearest neighbor search. A database perspective.
This monograph explores the way spatial database management systems aim at supporting queries that involve the space characteristics of the underlying data, and discusses query processing techniques for nearest neighbor queries. It provides both basic concepts and state-of-the-art results in spatial databases and parallel processing research, and studies numerous applications of nearest neighbor queries. It is an excellent reference for researchers, postgraduate students, and practitioners in computer science concerned with nearest neighbor search and related issues. The material is organized in three parts. Part I covers fundamental issues regarding spatial databases. This part is composed of three chapters. Chapter 1 performs a gentle introduction to spatial database concepts, by discussing issues related to query processing, indexing and handling multidimensional datasets. In Chapter 2 the authors focus on the R-tree family of spatial access methods, and discuss issues related to indexing spatial objects. Several important R-tree variations are also briefly presented. Part II consists of three chapters. Chapter 3 discusses in detail nearest neighbor query processing in R-trees, applications of nearest neighbor search and some important issues regarding nearest neighbor search in multimedia database systems. In Chapter 4 the authors study the issue of cost estimation in nearest neighbor queries using fractal concepts. Finally, Chapter 5 studies nearest neighbor queries in spatiotemporal databases, and more specifically in moving objects databases. Part III covers parallel and distributed processing of nearest neighbor queries. Chapter 6 gives the appropriate background in parallel and distributed databases, and discusses several important issues. Chapter 7 studies the problem of nearest neighbor query processing in a single-processor multidisk system. In such a system the dataset is declustered among all disks and therefore several disk access operations can be performed in parallel, reducing the query response time. Chapter 8 studies nearest neighbor query processing in a system composed of many disks and many processors. The dataset and the corresponding access method are declustered among a number of computers. The challenge is to provide efficient processing techniques to answer the nearest neighbor query by exploiting parallelism. Chapter 9 studies the problem in a similar environment, by allowing each computer to manage its own local database independently from the others. The Epilogue at the end of the book summarizes the authors' work and gives some directions for future research in the area.
- R-trees: theory and applications
- kNN-P: a kNN classifier optimized by P systems
- Nearest-neighbor searching under uncertainty. I
- Using spatial data access structures for filtering nearest neighbor queries
- Search Space Reductions for Nearest-Neighbor Queries
- A taxonomy for nearest neighbour queries in spatial databases
- Processing distance-based queries in multidimensional data spaces using R-trees
- scientific article; zbMATH DE number 2065609 (Why is no real title available?)
- Nearest neighbor query in road networks
- A general and efficient approach for solving nearest neighbor problem in the vague query system
- Evaluation of buffer queries in spatial databases (extended abstract)
- Constrained nearest neighbor queries
- When is nearest neighbors indexable?
- Processing constrainedK closest pairs query in spatial databases
- A memetic algorithm for evolutionary prototype selection: A scaling up approach
This page was built for publication: Nearest neighbor search. A database perspective.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673002)
