GithubHelp home page GithubHelp logo

geo.lua's Introduction

geo.lua - helper library for Redis geospatial indices ๐ŸŒ

This is a Lua library containing miscellaneous geospatial helper routines for use with Redis. It requires the Redis GEO API, available from v3.2.

In broad strokes, the library provides:

The library is strictly ๐Ÿ“ metric, sorry. Metric system adoption worldwide

Using geo.lua

The library is an ordinary Redis Lua script - use EVAL or EVALSHA to call it. The following example demonstrates usage from the prompt:

$ redis-cli SCRIPT LOAD "$(cat geo.lua)"
"fd07..."
$ redis-cli EVALSHA fd07... 0 help
 1) "geo.lua (0.1.5): A helper library for Redis geospatial indices"
 ...

Library API

GEO API completeness

GEOBEARING KEYS[1] geoset ARGV[2] member1 3] member2

Return the initial and final bearing between two members.

Time complexity: O(1).

For information about the calculation refer to http://mathforum.org/library/drmath/view/55417.html.

Return: Array reply, specifically the initial and final bearings.

GEOPATHLEN KEYS[1] geoset ARGV[2] member [...]

The length of a path between members.

Time complexity: O(N) where N is the number of members.

Note: This is basically a variadic form for GEODIST.

Return: String reply, specifically the length in meters.

GEODEL KEYS[1] geoset ARGV[2] member [...]

Delete members from a geoset.

Time complexity: O(M*log(N)) with N being the number of elements in the geoset and M the number of elements to be removed.

This command is an alias for ZREM to disprove the GEO incompleteness theorem. Technically it should be called GEOREM however.

Return: Integer reply, specifically the number of members actually deleted.

2D geometries and polygon search

Redis' geosets allow storing (and querying) of Point (2D, x/y, longitude & latitude) geometries. Other geometries can be stored serialized (using msgpack) in a Redis Hash data structure - the geomash. The geoset and the geomash are used for storing geometries in the following manner:

Geometry Storage GEOMETRYADD GEOMETRYGET GEOMETRYFILTER GEOJSONADD
Point geoset N/A N/A No Yes
Polygon geomash Yes Yes Yes Yes
MultiPolygon geomash TODO TODO TODO RODO
MultiPoint TODO TODO TODO No TODO
LineString TODO TODO TODO TODO TODO
MultiLineString TODO TODO TODO TODO TODO
GeometryCollection TODO TODO TODO TODO TODO

GEOMETRYADD KEYS[1] geomash ARGV[2] geometry-type 3] id 4..]

Upsert a single geometry to a geomash.

Time complexity:

ARGV[4] and above describe the geometry. Depending on the geometry's type:

  • POLYGON - each pair of ARGVs (e.g., 4 and 5, 6 and 7, ...) represent the coordinates of a vertex (longitude and latitude). A minimum of 4 vertices are required to define a polygon, with the first and last vertices being equal (a LineRing).

Note: there is no GEOMETYREM, use HDEL instead.

Return: Integer reply, specifically 0 if updated and 1 if added.

GEOMETRYGET KEYS[1] geomash ARGV[a] [WITHPERIMETER|WITHBOX|WITHCIRCLE] [...] ARGV[2] id [...]

Returns geometries' coordinates.

Time complexity:

The reply can be enriched with meta data about the geometry. The following sub-commands are supported, depending on the type of geometry.

  • WITHPERIMETER: For Polygon, The total length of edges
  • WITHBOX: The bounding box of the geometry
  • WITHCIRCLE: The bounding circle of the geometry

Return: Array reply, specifically:`

  • The geometry's type
  • The geometry's coordinates
  • When called with WITHPERIMETER, the total length of edges
  • When called with WITHBOX, the minimum and maximum coordinates of the bounding box, as well as it's bounding circle's radius
  • When called with WITHCIRCLE, the center coordinates and radius of bounding circle

GEOMETRYFILTER KEYS[1] geoset 2] geomash a] [target] ARGV[a] [STORE|WITHCOORD] [...] ARGV[2] id

Search for geoset members inside a geometry.

Time complexity:

This command performs a GEORADIUS search that contains the geometry's bounding box. The results are then filtered using a Point-In-Polygon (PIP) algorithm ([source](https://www.ecse.rpi.edu/~wrf/Research/Short_Notes/pnpoly.html#The C Code)).

The following sub-commands are supported:

  • STORE: Stores the search results in the target geoset
  • WITHCOORD: Returns the members' coordinates as well

Return: Array reply, specifically the members and their coordinates (if called with WITHCOORD). When the STORE directive is used, the reply is an Integer that indicates the number of members that were upserted to the target geoset.

GeoJSON

A minimal implementation of the spec's v1.0 for decoding and encoding geoset and geomash members from/to FeatureCollections and Features.

GEOJSONADD KEYS[1] geoset 2] geomash ARGV[1] GeoJSON

Time complexity: O(log(N)) for each feature in the GeoJSON object, where N is the number of members in the geoset.

Upsert points to the geoset, other geometries to the geomash. A valid input GeoJSON object must be FeatureCollection. Each Feature's type must be Point or a Polygon, and the feature's properties must include a member named id.

Return: Integer reply, specifically the number of features upserted.

GEOJSONENCODE KEYS[1] geoset ARGV[2] 3] [arg] [...]

Time complexity: depends on the GEO command and its arguments.

Encodes the reply of GEO commands as a GeoJSON object. Valid GEO commands are:

  • GEOHASH
  • GEOPOS
  • GEORADIUS and GEORADIUSBYMEMBER
  • [GEOMETRYFILTER]

Return: String, specifically the reply of the GEO command encoded as a GeoJSON object.

Location updates

Implements a real-time location tracking mechanism. Inspired by Matt Stancliff @mattsta.

GEOTRACK KEYS[1] geoset ARGV[2] longitude 3] latitude 4] member [...]

Time complexity: O(log(N)+M+P) for each item added, where N is the number of elements in the geoset, M is the number of clients subscribed to the receiving channel and P is the total number of subscribed patterns (by any client).

GEOADDs a member and PUBLISHs on channel __geo:<geoset>:<member> a message with the format of <longitude>:<latitude>.

Clients can track updates made to a specific member by subscribing to that member's channel (i.e. SUBSCRIBE__geo:<geoset>:<member>) or to all members updates (i.e. PSUBSCRIBE__geo:<geoset>:*).

Return: Integer reply, specifically the number of members upserted.

xyzsets

Redis' geospatial indices only encode the longitude and latitude of members with no regard to their altitude. An xyzset uses two sorted sets, one as geoset and the other for storing altitudes.

GEOZADD KEYS[1] geoset 2] azset ARGV[2] logitude 3] latitude 4] altitude 5] member [...]

Time complexity: O(log(N)) for each item added, where N is the number of elements in the geoset.

Upsert members. Altitude is given as meters above (or below) sea level.

Return: Integer reply, specifically the number of members upserted.

GEOZREM KEYS[1] geoset 2] azset ARGV[2] member [...]

Time complexity: O(M*log(N)) with N being the number of elements in the geoset and M the number of elements to be removed.

Remove members.

Return: Integer reply, specifically the number of members actually deleted.

GEOZPOS KEYS[1] geoset 2] azset ARGV[2] member [...]

Time complexity: O(log(N)) for each member requested, where N is the number of elements in the geoset.

The position of members in 3D.

Return: Array reply, specifically the members and their positions.

TODO: GEOZDIST

Returns the distance between members.

TODO: GEOZCYLINDER

Perform cylinder-bound search.

TODO: GEOZCYLINDERBYMEMBER

Perform cylinder-bound search by member (a 20 characters command!).

TODO: GEOZSPHERE

Useful for directing air traffic and impact research (bombs, comets).

TODO: GEOZCONE

Good for comparing ๐Ÿ‘ฝ sightings vis a vis ๐Ÿฎ abduction data.

Motility

Storing each member's vector in an additional hash data structure, where the field is the member's name and the value is the serialized vector (bearing & velocity).

TODO: GEOMADD KEYS[1] geoset 2] vector hash ARGV[2] longitude 3] latitude 4] bearing 5] velocity 6] member [...]

Upsert members. Bearing given in degrees, velocity in meters/second.

TODO: GEOMREM KEYS[1] geoset 2] vector hash ARGV[2] member [...]

Remove members.

TODO: GEOMPOSWHEN KEYS[1] geoset 2] vector hash ARGV[2] seconds 3] member [...]

Project members position in future or past.

TODO: GEOMMEETWHENWHERE KEYS[1] geoset 2] vector hash ARGV[2] member1 3] member2

Help solving basic math exercises.

License

3-Clause BSD.

Contributing

You're encouraged to contribute to the open source geo.lua project. There are two ways you can do so.

Issues

If you encounter an issue while using the geo.lua library, please report it at the project's issues tracker. Feature suggestions are also welcome.

Pull request

Code contributions to the geo.lua project can be made using pull requests. To submit a pull request:

  1. Fork this project.
  2. Make and commit your changes.
  3. Submit your changes as a pull request.

geo.lua's People

Contributors

caoyi0905 avatar cristiangreco avatar itamarhaber avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.