Spatial data management
By: Nikos Mamoulis
Series: Synthesis lectures on data management -- # 21
Publisher: Morgan & Claypool
Published: 2012
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] /
Number of pages: 133
ISBN-13: 9781608458332; 9781608458325
Subjects: Spatial data infrastructures; Geospatial data; Database management
Other titles: Synthesis digital library of engineering and computer science.
Description: Spatial database management deals with the storage, indexing, and querying of data with spatial features, such as location and geometric extent. Many applications require the efficient management of spatial data, including Geographic Information Systems, Computer Aided Design, and Location Based Services. The goal of this book is to provide the reader with an overview of spatial data management technology, with an emphasis on indexing and search techniques. It first introduces spatial data models and queries and discusses the main issues of extending a database system to support spatial data. It presents indexing approaches for spatial data, with a focus on the R-tree. Query evaluation and optimization techniques for the most popular spatial query types (selections, nearest neighbor search, and spatial joins) are portrayed for data in Euclidean spaces and spatial networks. The book concludes by demonstrating the ample application of spatial data management technology on a wide range of related application domains: management of spatio-temporal data and high-dimensional feature vectors, multi-criteria ranking, data mining and OLAP, privacy-preserving data publishing, and spatial keyword search.
Notes: Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 119-132).

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Title from PDF t.p. (viewed on December 17, 2011).
Table of contents: title: Preface; title: Acknowledgments; title: 1. Introduction; title: 1.1 Spatial data types, predicates, and queries; title: 1.2 Extending a DBMS to an SDBMS; title: 1.3 Historical evolution of research and systems development; title: 1.4 Summary and outline; title: 2. Spatial data; title: 2.1 Spatial relationships; title: 2.1.1 Topological relationships; title: 2.1.2 Directional relationships; title: 2.1.3 Distance relationships; title: 2.2 Spatial queries; title: 2.3 Issues in spatial query processing; title: 2.3.1 Extent or not?; title: 2.4 Summary; title: 3. Indexing; title: 3.1 Point access methods; title: 3.1.1 The grid file; title: 3.1.2 Space filling curves; title: 3.1.3 The quadtree; title: 3.2 Indexing objects with extent; title: 3.3 The R-tree; title: 3.3.1 Optimization of the R-tree structure; title: 3.3.2 The R*-tree: an optimized version of the R-tree; title: 3.3.3 Bulk-loading R-trees; title: 3.4 Summary; title: 4. Spatial query evaluation; title: 4.1 Spatial selections; title: 4.2 Nearest neighbor queries; title: 4.2.1 A depth-first nearest neighbor search algorithm; title: 4.2.2 A best-first nearest neighbor search algorithm; title: 4.2.3 K-nearest neighbor search and incremental search; title: 4.3 Spatial joins; title: 4.3.1 Index-based methods; title: 4.3.2 Algorithms that do not consider indexes; title: 4.3.3 Single-index join methods; title: 4.3.4 A unified spatial join approach; title: 4.3.5 Comparison of spatial join algorithms; title: 4.3.6 The refinement step of a spatial join; title: 4.3.7 Distance joins and related queries; title: 4.4 Query optimization; title: 4.4.1 Selectivity estimation; title: 4.4.2 Cost estimation for spatial query operations; title: 4.5 Summary; title: 5. Spatial networks; title: 5.1 Modeling spatial networks; title: 5.2 Disk-based indexing approaches; title: 5.3 Shortest path computation; title: 5.3.1 Dijkstras algorithm; title: 5.3.2 A* search; title: 5.3.3 Bi-directional search; title: 5.3.4 Speeding-up search by preprocessing; title: 5.3.5 Query points on graph edges; title: 5.4 Evaluation of spatial queries over spatial networks; title: 5.4.1 Distance-based spatial selection; title: 5.4.2 Nearest-neighbor retrieval; title: 5.4.3 Join queries; title: 5.5 Path materialization techniques; title: 5.5.1 Hierarchical path materialization; title: 5.5.2 Compressing and indexing materialized paths; title: 5.5.3 Embedding methods; title: 5.6 Summary; title: 6. Applications of spatial data management technology; title: 6.1 Spatio-temporal data management; title: 6.1.1 Models and queries for spatio-temporal data; title: 6.1.2 Indexing; title: 6.2 High dimensional data management; title: 6.2.1 Similarity measures and queries; title: 6.2.2 Multi-dimensional indexes and the curse of dimensionality; title: 6.2.3 Gemini: generic multimedia object indexing; title: 6.3 Multi-criteria ranking; title: 6.3.1 Top-k and skyline evaluation using spatial access methods; title: 6.3.2 Spatially ranking data; title: 6.4 Data mining and OLAP; title: 6.4.1 Classification; title: 6.4.2 Clustering; title: 6.4.3 Association rules mining; title: 6.4.4 Spatial aggregation and on-line analytical processing; title: 6.5 Privacy-preserving publication of microdata; title: 6.6 Spatial information retrieval; title: 6.6.1 The inverted file; title: 6.6.2 Ranking by relevance; title: 6.6.3 Indexing for ranking queries; title: 6.6.4 Spatial keyword search; title: 6.7 Summary; title: Bibliography; title: Author's biography.