[DM1-4] Data Structures and Indices for Databases

Database queries and especially spatial queries require specific data structures to be performed satisfactory Relevant is: - Motivation, examples of typical non-spatial and spatial queries - Trees, B-tree, R-tree, Q-tree - Graphs, overview and relation to databases

External resources

• Karthi, S, and Prabu, S. "Improved Spatial Query Processing Framework for Spatial Data." Procedia Computer Science 132 (2018): 759-74. DOI: 10.1016/j.procs.2018.05.088
• Morin. Open Data Structures: An Introduction. OPEL (Open Paths to Enriched Learning), 2. Edmonton [Alberta]: AU Press, 2013.

Learning outcomes

• 2286 - Provide examples of typical non-spatial and spatial queries

  Provide examples of typical non-spatial and spatial queries

Self assessment

Outgoing relations

• [DM1-4] Data Structures and Indices for Databases subclassof [DM1] Foundations for Data Modelling Storage and Exploitation