Efficient evaluation of radial queries using the target tree

Authors:
Michael Morse;Jignesh M. Patel;William I. Grosky
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor MI 48105, USA.;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor MI 48105, USA.;Department of Computer and Information Science, University of Michigan-Dearborn, Dearborn MI 48128, USA
Venue:
International Journal of Bioinformatics Research and Applications
Year:
2007

Citing 21
Cited 0

ARTSccelerated ray-tracing system

IEEE Computer Graphics and Applications
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Shoring up persistent applications

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Processing queries by linear constraints

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods

ACM Computing Surveys (CSUR)
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
HLODs for faster display of large static and dynamic environments

I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Box-trees and R-trees with near-optimal query time

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Efficient processing of conical queries

Proceedings of the tenth international conference on Information and knowledge management
Real-Time Rendering

Real-Time Rendering
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Collision Detection for Interactive Graphics Applications

IEEE Transactions on Visualization and Computer Graphics
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids

IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs

IEEE Transactions on Visualization and Computer Graphics
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Fast Ray Tracing Using K-d Trees

Fast Ray Tracing Using K-d Trees

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel indexing structure, called the target tree, which is designed to answer a new type of spatial query, called the radial query. A radial query finds all objects in the spatial data set that intersect with line segments emanating from a single target point. Many biomedical applications use radial queries, including neurosurgical planning. A target tree uses a regular hierarchical decomposition of space using wedge shapes that emanate from the target point. We compare the target tree with the R*-tree and quadtree, and show that the target tree is significantly faster than these methods.