GeoTree: a data structure for constant time geospatial search enabling a real-time mix-adjusted median property price index
Robert Miller, Phil Maguire

TL;DR
The paper introduces GeoTree, a novel data structure enabling constant-time geospatial searches, facilitating real-time property price indices by efficiently managing geohashes for large datasets.
Contribution
GeoTree is a new data structure that allows constant-time geospatial neighbor searches using geohashes, improving real-time property index computations.
Findings
Enables real-time geospatial search with O(1) complexity
Retains linear memory usage, scalable to large datasets
Improves performance of property price index algorithms
Abstract
A common problem appearing across the field of data science is -NN (-nearest neighbours), particularly within the context of Geographic Information Systems. In this article, we present a novel data structure, the GeoTree, which holds a collection of geohashes (string encodings of GPS co-ordinates). This enables a constant time search algorithm that returns a set of geohashes surrounding a given geohash in the GeoTree, representing the approximate -nearest neighbours of that geohash. Furthermore, the GeoTree data structure retains memory requirement. We apply the data structure to a property price index algorithm focused on price comparison with historical neighbouring sales, demonstrating an enhanced performance. The results show that this data structure allows for the development of a real-time property price index, and can be scaled to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Automated Road and Building Extraction · Time Series Analysis and Forecasting
