Implementing the Topological Model Succinctly
We show that the topological model, a semantically rich standard to represent GIS data, can be encoded succinctly while efficiently answering a number of topology-related queries. We build on recent succinct planar graph representations so as to encode a model with m edges within \(4m+o(m)\) bits and answer various queries relating nodes, edges, and faces in \(o(\log \log m)\) time, or any time in \(\omega (\log m)\) for a few complex ones.
- 1.ISO/IEC 13249–3:2016. Information technology - Database languages - SQL multimedia and application packages - Part 3: Spatial. Technical report (2016)Google Scholar
- 3.Clark, D.R.: Compact PAT Trees. Ph.D. thesis, University of Waterloo, Canada (1996)Google Scholar
- 6.Ferres, L., Fuentes-Sepúlveda, J., Gagie, T., He, M., Navarro, G.: Fast and compact planar embeddings. Comput. Geom. Theor. App. (2018), to appear. Available at https://arxiv.org/abs/1610.00130. Preliminary version in Proceedings WADS 2017
- 11.Scholl, M.O.: Spatial Databases with Application to GIS. MK, Uganda (2002)Google Scholar