SlideServe
Menu
Préférences
© SlideServe · v2026

Comprehensive Overview of Data Structures and Access Methods in Spatial Data Management

jane avatar
11 diapositives · 245 Views · Aug 23, 2014

This document provides an extensive examination of various data structures and access methods utilized in the management and retrieval of spatial data. It covers unordered and ordered file access through linear and binary searches, detailing several indexing techniques such as row order, Cantor diagonal, and R-trees. The work also highlights point object structures like quadtree and 2D-tree, alongside methods for Voronoi diagrams and mobile object indexing. Its findings underline the significance of these structures in modern applications like GIS and intelligent navigation.

Comprehensive Overview of Data Structures and Access Methods in Spatial Data Management - slide 1
01 / 11Comprehensive Overview of Data Structures and Access Methods in Spatial Data Management
1 / 17

Télécharger la présentation

Comprehensive Overview of Data Structures and Access Methods in Spatial Data Management
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. Data Structure and access method Fan Zhang Zhiqi Chen

  2. Unordered file • Linear search Ordered file • Binary search

  3. One to Two Dimensions • Six title index: • row order • row-prime order • Cantor-diagonal order • spiral order • Morton order • Peano-Hilbert order.

  4. Raster Structure • chain codes • Run-length encoding (RLE) • Block encoding dimensions. Point Object Structure • Grid structure • Point quadtree • 2D-tree

  5. Linear Objects • PM quadtrees • PM1 quadtree • PM2 quadtree • PM3 quadtree Collection of Objects • Rectangles & Minnimum bounding boxes • R-trees & R+-trees • BSP-tree

  6. Spherical Data Structures • Provide methods to surface of the Earth • Quaternary triangular mesh (QTM)

  7. Voronio Diagram • Decomposes a set of objects in a spatial • Variants: the k-th order, the Farthest-Site • Method to create a VoronoiDiagram • Been used in: science, astronomy, biology, nearest neighbor problem, and route planning.

  8. R-Trees • Aimportant access method in Spatial Data Management. • A ubiquitous data structure • The splitting criteria: Linear Split, Quadratic Split, Exponential Split. • Various: R+-tree, R*-Tree, Static R-tree, Packed R-tree, Hilbert Packed R-tree, STR R-tree, Time-Evolving R-tree • Used for: processing spatial queries, spatio-temporal database, multimedia database, data warehousing and data mining. Based on the research, it covers almost every aspect of concerning a database. • Will be important in modern system and application.

  9. R*-Trees • An efficiently access method for points and rectangles. • A popular access method in database systems organizing both multidimensional point data and spatial data. • More suitable for the more complex object representation. • Supports point and spatial data at the same time and its implementation cost is a little higher than of other R-tree variants. • R*-tree has been used in geographic information system (GIS), digital mock-up (DMU), and multidimensional feature vectors.

  10. Mobile Object Indexing • Been used in location-aware applications • traffic monitoring, • intelligent navigation • mobile communications management

  11. Thank you! • Any question?