Priority R-tree

The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree. It was first proposed by Arge, De Berg, Haverkort… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2004-2015
0120042015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we propose two novel active learning algorithms: 1) k-mode for classifying the certain and uncertain dataset in a… (More)
  • figure 1
  • table 6
  • table 6.1
  • figure 6.1
  • figure 6.2
Is this relevant?
2015
2015
The widespread of geospatial services produces massive volumes of spatial data. Cloud computing is a necessity for big data… (More)
Is this relevant?
2012
2012
  • Ke Yi
  • SIGSPATIAL Special
  • 2012
Window queries. Let S be a set of N axis-parallel hypercubes in Rd. A very basic operation in a spatial database is to answer… (More)
  • figure 1
Is this relevant?
2010
2010
According to the efficiency bottleneck of algorithm DBSCAN, we present P-DBSCAN, a novel parallel version of this algorithm in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table I
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1 1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 5
Is this relevant?