Data Structure and access method Fan Zhang Zhiqi Chen.

Slides:

Advertisements

Similar presentations

1 DATA STRUCTURES USED IN SPATIAL DATA MINING. 2 What is Spatial data ? broadly be defined as data which covers multidimensional points, lines, rectangles,

Advertisements

Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.

Spatial and Temporal Data Mining V. Megalooikonomou Spatial Access Methods (SAMs) II (some slides are based on notes by C. Faloutsos)

Spatial Data Structures Hanan Samet Computer Science Department

Multidimensional Indexing

Access Methods for Advanced Database Applications.

1 Storage of images for Efficient Retrieval  Representing IDB as relations  straightforward  Representing IDB with spatial data structures  represent.

Multidimensional Data Rtrees Bitmap indexes. R-Trees For “regions” (typically rectangles) but can represent points. Supports NN, “whereamI” queries.

3D Shape Histograms for Similarity Search and Classification in Spatial Databases. Mihael Ankerst,Gabi Kastenmuller, Hans-Peter-Kriegel,Thomas Seidl Univ.

Preferential top-k search over local data dissertation thesis RNDr. Martin Šumák supervisor: doc. RNDr. Stanislav Krajči, PhD. consultant: RNDr. Peter.

Spatial Mining.

Indexing Network Voronoi Diagrams*

2-dimensional indexing structure

Multiple-key indexes Index on one attribute provides pointer to an index on the other. If V is a value of the first attribute, then the index we reach.

Spatial analysis in the next decade Department of Urban Engineering University of Tokyo Yukio Sadahiro.

Spatio-Temporal Databases

Spatio-Temporal Databases. Outline Spatial Databases Temporal Databases Spatio-temporal Databases Multimedia Databases …..

Spatial Information Systems (SIS) COMP Raster-based structures (2) Data conversion.

Multi-dimensional Indexes

Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.

PROCESS IN DATA SYSTEMS PLANNING DATA INPUT DATA STORAGE DATA ANALYSIS DATA OUTPUT ACTIVITIES USER NEEDS.

Structures and Access Methods

COMP 451/651 Multiple-key indexes

Indexing Spatio-Temporal Data Warehouses Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zhang Department of Computer Science Hong Kong University of Science.

 Spatial data requires special data structures, similar to B-trees.

Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.

Spatial Indexing I Point Access Methods. Spatial Indexing Point Access Methods (PAMs) vs Spatial Access Methods (SAMs) PAM: index only point data Hierarchical.

GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.

Rebecca Boger Earth and Environmental Sciences Brooklyn College.

Benjamin Post Cole Kelleher. Encyclopedia Articles: PostGIS, C. Strobl, pp Oracle Spatial, Geometries, R. Kothuri and S. Ravada, page

Data Structures for Computer Graphics Point Based Representations and Data Structures Lectured by Vlastimil Havran.

Guofeng Cao CyberInfrastructure and Geospatial Information Laboratory Department of Geography National Center for Supercomputing Applications (NCSA) University.

Spatial Indexing and Visualizing Large Multi-dimensional Databases I. Csabai, M. Trencséni, L. Dobos, G. Herczegh, P. Józsa, N. Purger Eötvös University,

Trees for spatial data representation and searching

Spatial Data Management Chapter 28. Types of Spatial Data Point Data –Points in a multidimensional space E.g., Raster data such as satellite imagery,

Database management Systems, 3ed, R. Ramakrishnan and J. Gehrke1 Spatial Data Management Chapter 28.

Raster Data Chapter 7. Introduction  Vector – discrete  Raster – continuous  Continuous –precipitation –elevation –soil erosion  Regular grid cell.

Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-2 Chapters 3 and 4.

Mutlidimensional Indices Instructor: Randal Burns Lecture for 29 November 2005 Computer Science Johns Hopkins University.

Indexing for Multidimensional Data An Introduction.

Chapter 3 Digital Representation of Geographic Data.

Introduction to The NSP-Tree: A Space-Partitioning Based Indexing Method Gang Qian University of Central Oklahoma November 2006.

Multidimensional Indexes Applications: geographical databases, data cubes. Types of queries: –partial match (give only a subset of the dimensions) –range.

Indexing for Multidimensional Data An Introduction.

Indexing and Visualizing Multidimensional Data I. Csabai, M. Trencséni, L. Dobos, G. Herczegh, P. Józsa, N. Purger Eötvös University,Budapest.

Guofeng Cao CyberInfrastructure and Geospatial Information Laboratory Department of Geography National Center for Supercomputing Applications (NCSA) University.

Spatial and Geographic Databases ADVANCED DATABASES Khawaja Mohiuddin Assistant Professor Department of Computer Sciences Bahria University (Karachi Campus)

Spatial DBMS Spatial Database Management Systems.

Spatial Database 2/5/2011 Reference – Ramakrishna Gerhke and Silbershatz.

Spatial Indexing Techniques Introduction to Spatial Computing CSE 5ISC Some slides adapted from Spatial Databases: A Tour by Shashi Shekhar Prentice Hall.

Chapter 5 Multidimensional Indexes. One dimensional index can be used to support multidimensional query. F1=‘abcd’ F2= 123‘abcd#123’

A New Spatial Index Structure for Efficient Query Processing in Location Based Services Speaker: Yihao Jhang Adviser: Yuling Hsueh 2010 IEEE International.

Spatial and Geographic Databases. Spatial databases store information related to spatial locations, and support efficient storage, indexing and querying.

Spatial Indexing Techniques Introduction to Spatial Computing CSE 5ISC Some slides adapted from Spatial Databases: A Tour by Shashi Shekhar Prentice Hall.

Spatial Databases - Indexing

Towards Unifying Vector and Raster Data Models for Hybrid Spatial Regions Philip Dougherty.

File Processing : Multi-dimensional Index 2015, Spring Pusan National University Ki-Joune Li.

FYTG 5101 Presentation Data Management For Spatio-temporal Data Of PM 2.5 Indices Through Mobile Sensing Type of This Project: Survey Yun Wen.

What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”

Raster Data Models: Data Compression Why? –Save disk space by reducing information content –Methods Run-length codes Raster chain codes Block codes Quadtrees.

Spatial Data Models Geography is concerned with many aspects of our environment. From a GIS perspective, we can identify two aspects which are of particular.

Multidimensional Access Methods Ho Hoang Nguyen Nguyen Thanh Trong Dao Vu Quoc Trung Ngo Phuoc Huong Thien DATABASE.

Jeremy Iverson & Zhang Yun 1.  Chapter 6 Key Concepts ◦ Structures and access methods ◦ R-Tree  R*-Tree  Mobile Object Indexing  Questions 2.

Multidimensional Access Structures COMP3017 Advanced Databases Dr Nicholas Gibbins –

Spatial Data Management

Mehdi Kargar Department of Computer Science and Engineering

Spatial Indexing I Point Access Methods.

Multidimensional Indexes

Spatial Data Management

Multidimensional Search Structures

Presentation transcript:

Data Structure and access method Fan Zhang Zhiqi Chen

Unordered file  Linear search Ordered file  Binary search

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

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

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

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

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

R-Trees  A important 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.

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.

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

Thank you!  Any question ？