This demo shows the basics of geospatial indexing with q.

A 10-million-point random data set is queried from the HTML map client. Click on the map to see nearby points.

Download KxSystems/kdb/e/ and run:

$ make -C s2
$ q q/geo.q
$ open html/geo.html
This should then open a browser, connect to the q process and retrieve geo.html, displayed similar to:


There are five text fields in the top row:

  • Last click coordinates 
  • Number of returned results 
  • Min date* 
  • Max date* 
  • Lookup rectangle size* (degrees)

Those marked with * are editable filters.

When the mouse is clicked on the map, the underlying lat-lon coordinates are sent to the q process along with the filters over a websocket connection, and the points in the response are then plotted on the map. In addition to coordinates, q returns a trk column, which the client interprets as point colour.

This uses the Google S2 library as a q shared object.

To create the index, the function ids[lats;lons] maps (lat-lon) coordinates on a sphere to one-dimensional cell IDs. These are stored as 32-bit integers with the `p attribute applied.

time                          trk  lat      lon       cid       
2016.09.26D00:40:05.783973634 3233 51.79961 0.1946887 1205375107
2016.09.26D01:12:53.469740152 3233 51.80003 0.1923668 1205375107
2016.09.26D01:40:23.427598178 3233 51.79994 0.192314  1205375107
2016.09.26D04:11:52.743414938 3233 51.79958 0.1950875 1205375107
2016.09.26D08:39:32.459766268 3233 51.80044 0.1923126 1205375107

q)meta geo
c   | t f a
----| -----
time| p    
trk | j    
lat | f    
lon | f    
cid | i   p
lu, defined in geo.q as
{[x;y]select from pl rect . x where all(lat;lon;time)within'(x,enlist y)}
retrieves points contained in the given spherical rectangle. lu takes the rectangle coordinates with a time filter, and calculates the coverage (ranges of cells covering the rectangle) with rect[(lat0;lat1);(lon0;lon1)]. The cell ID ranges are looked up with pl, defined in geo.q as
{raze{select[x]lat,lon,trk,time from geo}each flip deltas geo.cid binr/:x}
The result is then filtered to remove points outside the rectangle (since the covering might exceed the rectangle dimensions) and to constrain by time.

The simple HTML interface is implemented with openstreetmap and leaflet.