ScholarLens Back to search
2008•Unpublished venueRequires access

Revisiting 2DR-tree insertion

Marc Moreau, Wendy Osborn

Open publisher page 2 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Tree (set theory), Tree structure, Computer science, Node (physics), Space (punctuation), Data structure, Theoretical computer science, Algorithm

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Revisiting 2DR-tree insertion — Research Paper | ScholarLens