Presentation is loading. Please wait.

Presentation is loading. Please wait.

R-tree – Another Example (1/2)

Published byΠλάτων Πυλαρινός Modified over 5 years ago

Similar presentations

Presentation on theme: "R-tree – Another Example (1/2)"— Presentation transcript:

1 R-tree – Another Example (1/2)
Antonin Guttman R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84)

2 R-tree – Another Example (2/2)
Antonin Guttman R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84)

3 Insert the new data point Nw into the R-tree shown
R-tree – Insertion Another Example Insert the new data point Nw into the R-tree shown Nw Antonin Guttman R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84)

4 Nw goes here creating an overflow
R-tree – Insertion Another Example Nw Nw goes here creating an overflow Antonin Guttman R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on Management of data (SIGMOD '84)

5 Nw goes here creating an overflow
R-tree – Insertion Another Example Nw Nw goes here creating an overflow

6 R-tree – Another Example Splitting R3
Nw

7 R-tree – Another Example Splitting R3: Step 1
Nw

8 R-tree – Another Example Splitting R3: Step 2
Nw

9 R-tree – Another Example Splitting R3: Step 3
Nw

10 R-tree – Another Example Splitting R3

11 R-tree – Another Example Adjusting the tree
M =3 m =2 R3 R4 R5 Nw R8 R9 R10

12 R-tree – Another Example Adjusting the tree
M =3 m =2 R3 R4 R5 R3’’ should go into this Nw R8 R9 R10

13 Overflow: This should be split
R-tree – Another Example Adjusting the tree M =3 m =2 Overflow: This should be split R3 R3’’ R4 R5 Nw R8 R9 R10

14 R-tree – Another Example Splitting R3 R3’’ R4 and R5

15 R-tree – Another Example Splitting R3 R3’’ R4 and R5

16 R-tree – Another Example Splitting R3 R3’’ R4 and R5

17 R-tree – Another Example Splitting R3 R3’’ R4 and R5

18 R-tree – Another Example Splitting R3 R3’’ R4 and R5

19 Overflow: This was split
R-tree – Another Example Adjusting the tree M =3 m =2 R1 R2 R3 R3’’ R4 R5 Overflow: This was split Nw R8 R9 R10

20 R-tree – Another Example Adjusting the tree
M =3 m =2 R1 R1’ R2 R3 R3’’ R4 R5

Download ppt "R-tree – Another Example (1/2)"

Similar presentations

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

Spatial and Temporal Data Mining V. Megalooikonomou Spatial Access Methods (SAMs) II (some slides are based on notes by C. Faloutsos)
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.
Hash-Based Indexes Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY.

Hash-Based Indexes Jianlin Feng School of Software SUN YAT-SEN UNIVERSITY.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 11.
Lecture 6 : Dynamic Hashing Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.

Lecture 6 : Dynamic Hashing Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
CS144: Spatial Index. Example Dataset Grid File (2 points per bucket) 40 55 225 90.

CS144: Spatial Index. Example Dataset Grid File (2 points per bucket)
Continuous Intersection Joins Over Moving Objects Rui Zhang University of Melbourne Dan Lin Purdue University Kotagiri Ramamohanarao University of Melbourne.

Continuous Intersection Joins Over Moving Objects Rui Zhang University of Melbourne Dan Lin Purdue University Kotagiri Ramamohanarao University of Melbourne.
Quad Trees By JJ Shepherd. Introduction So far we’ve only used binary trees to solve problems – Sort data – Search data – Confuse students Trees are not.

Quad Trees By JJ Shepherd. Introduction So far we’ve only used binary trees to solve problems – Sort data – Search data – Confuse students Trees are not.
1 Hash-Based Indexes Yanlei Diao UMass Amherst Feb 22, 2006 Slides Courtesy of R. Ramakrishnan and J. Gehrke.

1 Hash-Based Indexes Yanlei Diao UMass Amherst Feb 22, 2006 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
Insert 2000 0 1 1 0 0 1 0 0 0 A tree starts with the dummy node D 0 0 0 0 0 0 0 0 0 0 D 200 D 7 Insert 1000 0 0 1 1 0 0 1 0 0 100 D 6 200 7.

Insert A tree starts with the dummy node D D 200 D 7 Insert D
1 Hash-Based Indexes Chapter 11. 2 Introduction  Hash-based indexes are best for equality selections. Cannot support range searches.  Static and dynamic.

1 Hash-Based Indexes Chapter Introduction  Hash-based indexes are best for equality selections. Cannot support range searches.  Static and dynamic.
Spatial Indexing I Point Access Methods.

Spatial Indexing I Point Access Methods.
1 Hash-Based Indexes Chapter 11. 2 Introduction : Hash-based Indexes  Best for equality selections.  Cannot support range searches.  Static and dynamic.

1 Hash-Based Indexes Chapter Introduction : Hash-based Indexes  Best for equality selections.  Cannot support range searches.  Static and dynamic.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Range Searches  `` Find all students with gpa > 3.0 ’’  If data is in sorted file, do.

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Range Searches  `` Find all students with gpa > 3.0 ’’  If data is in sorted file, do.
Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.

Insertion into a B+ Tree Null Tree Ptr Data Pointer * Tree Node Ptr After Adding 8 and then 5… 85 Insert 1 : causes overflow – add a new level * 5 * 158.
R-TREES: A Dynamic Index Structure for Spatial Searching by A. Guttman, SIGMOD 1984. Shahram Ghandeharizadeh Computer Science Department University of.

R-TREES: A Dynamic Index Structure for Spatial Searching by A. Guttman, SIGMOD Shahram Ghandeharizadeh Computer Science Department University of.
Insertion in a B+ Tree Insert: 8. Insertion in a B+ Tree 8 Insert: 5.

Insertion in a B+ Tree Insert: 8. Insertion in a B+ Tree 8 Insert: 5.
R-Trees: A Dynamic Index Structure for Spatial Data Antonin Guttman.

R-Trees: A Dynamic Index Structure for Spatial Data Antonin Guttman.
Introduction Using time property and location property from lost items’ pictures, we construct the Lost and Found System which combined with image search.

Introduction Using time property and location property from lost items’ pictures, we construct the Lost and Found System which combined with image search.
Mehdi Kargar Department of Computer Science and Engineering 1.

Mehdi Kargar Department of Computer Science and Engineering 1.

Similar presentations

Ads by Google