Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Python Geospatial Development

You're reading from   Python Geospatial Development Develop sophisticated mapping applications from scratch using Python 3 tools for geospatial development

Arrow left icon
Product type Paperback
Published in May 2016
Publisher
ISBN-13 9781785288937
Length 446 pages
Edition 3rd Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Erik Westra Erik Westra
Author Profile Icon Erik Westra
Erik Westra
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Geospatial Development Using Python FREE CHAPTER 2. GIS 3. Python Libraries for Geospatial Development 4. Sources of Geospatial Data 5. Working with Geospatial Data in Python 6. Spatial Databases 7. Using Python and Mapnik to Generate Maps 8. Working with Spatial Data 9. Improving the DISTAL Application 10. Tools for Web-based Geospatial Development 11. Putting It All Together – a Complete Mapping System 12. ShapeEditor – Importing and Exporting Shapefiles 13. ShapeEditor – Selecting and Editing Features Index

Spatial indexes


One of the defining characteristics of a spatial database is the ability to create and use "spatial" indexes to speed up geometry-based searches. These indexes are used to perform spatial operations, such as identifying all the features that lie within a given bounding box, identifying all the features within a certain distance of a given point, or identifying all the features that intersect with a given polygon.

Spatial indexes are one of the most powerful features of spatial databases, and it is worth spending a moment becoming familiar with how they work. Spatial indexes don't store the geometry directly; instead, they calculate the bounding box for each geometry and then index the geometries based on their bounding boxes. This allows the database to quickly search through the geometries based on their position in space:

The bounding boxes are grouped into a nested hierarchy based on how close together they are, as shown in the following illustration:

The hierarchy of nested...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime