R-tree

Known as: R Tree, R Trees, Rtree

R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

Location-based services (LBS) are becoming more important and gaining attractiveness of mobile users due to the development of…

2007

A reverse nearest neighbor (RNN) search retrieves all points in a given data set whose nearest neighbor is a given query point…

2006

The thesis of this dissertation deals with ubiquitous and wireless pervasive computing. The main focus is on data centric…

2005

In recent years, the research on spatial indexing is arousing more and more interests and attentions. A number of spatial…

2003

Biography Lecturer in Spatial Information, University of Otago, NZ (2002-) Recently completed PhD (Geographical Sciences…

1999

A hyper-rectangle is commonly used as a bounding predicate in tree-based access methods in databases. To reduce the number of I/O…

1999

With a large amount of data stored in spatial databases, one may like to nd groups of data which share similar features, such as…

1999

A lot of recent work has studied strategies related to bulk loading of large data sets into multidimensional index structures. In…

1993

Spatial data management has been an active area of research during the past two decades, and results of research into spatial…

1992

An R-tree (X, d) is a uniquely arcwise connected metric space in which each arc is isometric to a subarc of the reals. R-trees…