R* tree

Known as: R*-tree, R*tree 
R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard R-trees, as… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In this paper we present an improved redesign of the R*-tree that is entirely suitable for running within a DBMS. Most… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 3
Is this relevant?
2005
2005
Similarity and cluster analysis are important aspects for analyzing microarray data. Based on our perspective of viewing… (More)
  • table 3
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2005
2005
Similarity search operations require executing expensive algorithms, and although broadly useful in many new applications, they… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Existing analysis for R-trees is inadequate for several traditional and emerging applications including, for example, temporal… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Time series stored as feature vectors can be indexed by multi dimensional index trees like R-Trees for fast retrieval. Du e to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
CM-line loading of R-trees is useful to improve node utilization and query performance. WTepresent an algorithm for bulk loading… (More)
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Data clustering is an important technique for exploratory data analysis, and has been studied for several years. It has been… (More)
  • figure 6
  • figure 5
  • figure 8
  • figure 9
  • figure 12
Is this relevant?
1992
1992
This work is based on research partially supported by Fair eld University. Let G be a pseudogroup defined on a tree Z, and let be… (More)
  • figure 2
Is this relevant?