Nearest Neighbor Search:: A Database Perspective: Series in Computer Science
Autor Apostolos N. Papadopoulos, Yannis Manolopoulosen Limba Engleză Hardback – 19 noi 2004
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 956.93 lei 43-57 zile | |
Springer Us – 6 dec 2010 | 956.93 lei 43-57 zile | |
Hardback (1) | 631.29 lei 43-57 zile | |
Springer Us – 19 noi 2004 | 631.29 lei 43-57 zile |
Din seria Series in Computer Science
- 15% Preț: 481.57 lei
- 20% Preț: 1259.06 lei
- 15% Preț: 624.89 lei
- 20% Preț: 976.35 lei
- 18% Preț: 1219.64 lei
- 20% Preț: 635.46 lei
- 20% Preț: 629.20 lei
- 20% Preț: 966.19 lei
- Preț: 311.69 lei
- 20% Preț: 325.70 lei
- 20% Preț: 966.02 lei
- 20% Preț: 337.49 lei
- Preț: 261.27 lei
- 20% Preț: 333.14 lei
- 20% Preț: 325.06 lei
- 15% Preț: 503.10 lei
- 23% Preț: 1043.26 lei
- 20% Preț: 260.38 lei
- 20% Preț: 325.31 lei
- 19% Preț: 420.41 lei
- 20% Preț: 695.18 lei
- 20% Preț: 571.44 lei
- Preț: 380.77 lei
- 23% Preț: 580.45 lei
- 20% Preț: 744.62 lei
- Preț: 384.50 lei
Preț: 631.29 lei
Preț vechi: 789.12 lei
-20% Nou
Puncte Express: 947
Preț estimativ în valută:
120.82€ • 125.50$ • 100.36£
120.82€ • 125.50$ • 100.36£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387229638
ISBN-10: 0387229639
Pagini: 170
Ilustrații: XXII, 170 p. 77 illus.
Dimensiuni: 152 x 229 x 16 mm
Greutate: 0.39 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Series in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0387229639
Pagini: 170
Ilustrații: XXII, 170 p. 77 illus.
Dimensiuni: 152 x 229 x 16 mm
Greutate: 0.39 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Series in Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Fundamental Issues.- Spatial Database Concepts.- The R-Tree and Variations.- Nearest Neighbor Search in Spatial and Spatiotemporal Databases.- Nearest Neighbor Queries.- Analysis of Nearest Neighbor Queries.- Nearest Neighbor Queries in Moving Objects.- Nearest Neighbor Search with Multiple Resources.- Parallel and Distributed Databases.- Multidisk Query Processing.- Multiprocessor Query Processing.- Distributed Query Processing.
Recenzii
From the reviews of the first edition:
"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 … . It is an excellent reference for researchers, postgraduate students and practitioners in computer science concerned with nearest neighbor search and related issues." (Marie Duží, Zentralblatt MATH, Vol. 1076, 2006)
"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 … . It is an excellent reference for researchers, postgraduate students and practitioners in computer science concerned with nearest neighbor search and related issues." (Marie Duží, Zentralblatt MATH, Vol. 1076, 2006)
Caracteristici
First comprehensive research monograph dedicated to nearest neighbor query processing The nearest neighbor search problem is studied in detail from the spatial database perspective; algorithms, analysis, and experimental evaluation are studied thoroughly Studies parallel and distributed query processing techniques for nearest neighbor search Contains pointers and valuable references for additional research in the area