MySQL 5.7, 8.0 and MongoDB: Geospatial Introduction

Alexander Rubin, Principal Architect from Percona and Michael Benshoof, Technical Account Manager from Percona delivers their talk, "MySQL 5.7, 8.0 and MongoDB: Geospatial Introduction", on DAY 2 of the Percona Live Open Source Database Conference 2017, 4/26, at Santa Clara, CA.

The goal of the talk is to review the GIS improvements in MySQL 5.7 and new additions in MySQL 8.0 (new this year!), provide some general review of the functionality, as well as some working demos. We'll also have a high-level review of MongoDB's GIS functionality, and discuss the pros/cons between MySQL and MongoDB and how you can use them in conjunction.

Attendee takeaway:

- Overview of GIS functionality in MySQL (5.7 and 8.0) and MongoDB
- High level samples and potential use cases
- Demo with Open Street Map in MySQL and MongoDB
- This isn't meant as a deep dive, but rather an intro-level talk

Additional description:

Geo-enabled (or location-enabled) applications are very common nowadays, and many of them use MySQL. The common tasks for such applications are:

-Find all points of interests (i.e., coffee shops) around (i.e., within a 10 mile radius) a given location (latitude and longitude). For example we want to show this to a user of a mobile application when we know his/her approximate location. (This usually means we need to calculate a distance between two points on Earth.)
-Find a ZIP code (U.S. postal address) for a given location, or determine if this location is within a given area. Another example is to find a school district for a given property.

MySQL had spatial functions originally (implementation follows a subset of OpenGIS standard).
MySQL 5.7 introduces spatial (R-Tree) indexes for InnoDB as well as a new functions to calculate the distance between points. MongoDB also support GIS functions and spatial indexes.

In our talk we will also show the real world examples of using open source GIS data (open street map, zip codes, etc.) with MySQL and MongoDB and demo some common queries.

[cd]

I have a question concerning MySql radius search. Alexander in a previous presentation you made available you stated that a stored procedure or spinx search was far quicker in search time than the standard haversine formula. Your pdf is a bit hard to digest as you dont show the table schema. Can you elaborate on this as I am building an application that needs radius search and want my queries optimised

[dewijones]

great talk.
But please sort the mic out