Presentation is loading. Please wait.

Presentation is loading. Please wait.

Indexing for Multidimensional Data An Introduction.

Published byTamsin Park Modified over 8 years ago

Similar presentations

Presentation on theme: "Indexing for Multidimensional Data An Introduction."— Presentation transcript:

1 Indexing for Multidimensional Data An Introduction

2 Jaruloj Chongstitvatana Advanced Data Structures 2 Applications of Multidimensional Databases Normal databases with multiple key Spatial databases Geographic information system (GIS) Computer-aided design (CAD) Multimedia databases Medical applications

3 Jaruloj Chongstitvatana Advanced Data Structures 3 Characteristics of Good Index Structures (1) Dynamic Insert, delete, and update data in any order Handle necessary queries Point or exact queries Range quesries Spatial queries Boolean queries

4 Jaruloj Chongstitvatana Advanced Data Structures 4 Characteristics of Good Index Structures (2) Good performance (disk accesses, running time, etc.) for Query, insert, delete Good storage (memory or disk) utilization Low percentage of waste space Scalability Simple

5 Jaruloj Chongstitvatana Advanced Data Structures 5 Why hierarchical structures Allow the search to be focused on interesting subset of data Eliminate useless search Clean and simple implementation

6 Jaruloj Chongstitvatana Advanced Data Structures 6 Hierarchical index structures for single attribute B tree Binary tree Unbalanced Organize data Memory-based index Measuring the running time Practical mem. size B+ tree N-ary tree Height-balanced Organize data space Disk-based index Measuring the number of disk accesses Disk page size

7 Jaruloj Chongstitvatana Advanced Data Structures 7 B tree 10 4 9 20 6 7

8 Jaruloj Chongstitvatana Advanced Data Structures 8 B+ tree 6 11 14 48 19 22 16 31

9 Jaruloj Chongstitvatana Advanced Data Structures 9 Handling multiple attributes (1) Separate index structure for each attributes Update all index structures for each record update. Data are scattered in many disk pages. a1a2a3 disk a4

10 Jaruloj Chongstitvatana Advanced Data Structures 10 Handling multiple attributes (2) Bit interleaving Attribute interleaving

11 Jaruloj Chongstitvatana Advanced Data Structures 11 Multiple-attribute indexing Quad-tree k-d tree k-d-B tree Grid file hB-tree

12 Jaruloj Chongstitvatana Advanced Data Structures 12 Spatial Indexing R-tree R*-tree SKD-tree

13 Jaruloj Chongstitvatana Advanced Data Structures 13 High-dimensional indexing SS-tree TV-tree

Download ppt "Indexing for Multidimensional Data An Introduction."

Similar presentations

Multidimensional Index Structures One dimensional index structures assume a single search key, and retrieve records that match a given search-key value.

Multidimensional Index Structures One dimensional index structures assume a single search key, and retrieve records that match a given search-key value.
1 Projection Indexes in HDF5 Rishi Rakesh Sinha The HDF Group.

1 Projection Indexes in HDF5 Rishi Rakesh Sinha The HDF Group.
External Memory Hashing. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B.

External Memory Hashing. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B.
CS4432: Database Systems II Hash Indexing 1. Hash-Based Indexes Adaptation of main memory hash tables Support equality searches No range searches 2.

CS4432: Database Systems II Hash Indexing 1. Hash-Based Indexes Adaptation of main memory hash tables Support equality searches No range searches 2.
©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Part C Part A:  Index Definition in SQL  Ordered Indices  Index Sequential.

©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Part C Part A:  Index Definition in SQL  Ordered Indices  Index Sequential.
Access Methods for Advanced Database Applications.

Access Methods for Advanced Database Applications.
File Processing : Hash 2015, Spring Pusan National University Ki-Joune Li.

File Processing : Hash 2015, Spring Pusan National University Ki-Joune Li.
Index tuning Hash Index. overview Introduction Hash-based indexes are best for equality selections. –Can efficiently support index nested joins –Cannot.

Index tuning Hash Index. overview Introduction Hash-based indexes are best for equality selections. –Can efficiently support index nested joins –Cannot.
1 Enviromatics 2008 - Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.

1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
B+-trees. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B = n pages I/O complexity:

B+-trees. Model of Computation Data stored on disk(s) Minimum transfer unit: a page = b bytes or B records (or block) N records -> N/B = n pages I/O complexity:
Spatial Mining.

Spatial Mining.
Spatial Indexing I Point Access Methods. PAMs Point Access Methods Multidimensional Hashing: Grid File Exponential growth of the directory Hierarchical.

Spatial Indexing I Point Access Methods. PAMs Point Access Methods Multidimensional Hashing: Grid File Exponential growth of the directory Hierarchical.
B+-tree and Hashing.

B+-tree and Hashing.
Quick Review of Apr 17 material Multiple-Key Access –There are good and bad ways to run queries on multiple single keys Indices on Multiple Attributes.

Quick Review of Apr 17 material Multiple-Key Access –There are good and bad ways to run queries on multiple single keys Indices on Multiple Attributes.
Dynamic Granular Locking Approach to Phantom Protection in R-trees Kaushik Chakrabarti Sharad Mehrotra Department of Computer Science University of Illinois.

Dynamic Granular Locking Approach to Phantom Protection in R-trees Kaushik Chakrabarti Sharad Mehrotra Department of Computer Science University of Illinois.
High-Dimensional Similarity Search using Data-Sensitive Space Partitioning ┼ Sachin Kulkarni 1 and Ratko Orlandic 2 1 Illinois Institute of Technology,

High-Dimensional Similarity Search using Data-Sensitive Space Partitioning ┼ Sachin Kulkarni 1 and Ratko Orlandic 2 1 Illinois Institute of Technology,
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.
Chapter 3: Data Storage and Access Methods

Chapter 3: Data Storage and Access Methods
Spatial Indexing I Point Access Methods.

Spatial Indexing I Point Access Methods.
Techniques and Data Structures for Efficient Multimedia Similarity Search.

Techniques and Data Structures for Efficient Multimedia Similarity Search.

Similar presentations

Ads by Google