Spatial Indexing for Moving Geometry in Main Memory
| dc.contributor.author | Aasa, Jakob | |
| dc.contributor.author | Lundberg, Marcus | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Assarsson, Ulf | |
| dc.contributor.supervisor | Stintorn, Erik | |
| dc.date.accessioned | 2019-10-03T14:04:33Z | |
| dc.date.available | 2019-10-03T14:04:33Z | |
| dc.date.issued | 2019 | sv |
| dc.date.submitted | 2019 | |
| dc.description.abstract | Spatial indexes are data structures which store objects in the form of points or geometry in two or more dimensions in such a way that subsets can be queried with high performance. However, good query performance is no guarantee for a corresponding update performance. There is currently little research of spatial indexing for non-point geometry which receive frequent updates. This thesis studies and compares different spatial indexes for this kind of data. The evaluated data structures are the simple quadtree, the loose quadtree, theloose-linear quadtree, and the R*-tree. A dynamic array is also implemented to represent a naïve approach. Where applicable, we augment the spatial indexes with two update techniques: bottom-up updating and update memo, to assess if these improve performance. Evaluation is performed by a benchmark suite, where a scenario of objects sampled from different data distributions is used to quantify query and update performance of the spatial indexes. This evaluation is divided into two steps. First, parameters specific to each data structure is chosen, with 10 million objects in the scenario. Then, we compare the data structures, the update techniques, and the memory usage of the selection. We find that the loose quadtree performs best for all measured scenarios in both updates and queries, while the R*-tree is worst, if not counting the query performance of the dynamic array. Bottom-up updating and update memo yielded unsatisfactory performance given the extra memory that is needed. The contribution of this thesis is twofold. First, we perform a thorough performance comparison for spatial indexes that support moving non-point geometry. To our knowledge, there exist no such survey at the time of writing. Secondly, we present novel query algorithms for the loose-linear quadtree which perform at least an order of magnitude better than other existing approaches. | sv |
| dc.identifier.coursecode | DATX05 | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/300391 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | Computer | sv |
| dc.subject | science | sv |
| dc.subject | computer science | sv |
| dc.subject | engineering | sv |
| dc.subject | spatial index | sv |
| dc.subject | quadtree | sv |
| dc.subject | r-tree | sv |
| dc.subject | main memory | sv |
| dc.subject | thesis | sv |
| dc.title | Spatial Indexing for Moving Geometry in Main Memory | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H |