Revisiting 2DR-tree insertion

We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships between all objects can be maintained. The existing structure has many advantages. However, two limitations include a high tree height and a low space utilization of its nodes. We propose changes to the 2DR-tree structure, validity rules and insertion strategy. Preliminary results show significant improvements in height and space utilization over the existing 2DR-tree. Categories and Subject Descriptors H.2.2 [Database Management]: Physical Design--access methods General Terms Algorithms, Design Keywords spatial access methods, insertion, performance

• Type: Conference
• Year: 2008
• Where: C3S2E
• Authors: Marc Moreau, Wendy Osborn
• Keywords: C3S2E 2008, Insertion Strategy, Software Engineering, Space Utilization, Validity Rules