STR: A Simple and Efficient Algorithm for R-Tree Packing.

Abstract

In this paper, we present the results from an extensive comparison study of three R-tree packing algorithms, including a new easy to implement algorithm. The algorithms are evaluated using both synthetic and actual data from various application domains including VLSI design, GIS (tiger), and computational fluid dynamics. Our studies also consider the impact that various degrees of buffering have on query performance. Experimental results indicate that none of the algorithms is for all types of data. In general, our new algorithm requires up to 50 previously proposed algorithm for point and region queries on uniformly distributed or mildly skewed point and region data, and approximately the same for highly skewed point and region data.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1997
Accession Number
ADA324493

Entities

People

  • Jeffrey M. Edgington
  • Mario A. Lopez
  • Scott T. Leutenegger

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Fluid Dynamics
  • Computer Science
  • Computers
  • Contractors
  • Data Sets
  • Databases
  • Dynamics
  • Equations
  • Fluid Dynamics
  • Geographic Information Systems
  • Hilbert Curve
  • Information Systems
  • Mathematics
  • Trees (Data Structures)
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.