Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Among spatial information applications, SpatialHadoop is one of the most important systems for researchers. Broad analyses prove… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 4
Is this relevant?
2016
2016
In this paper, we propose two novel active learning algorithms: 1) k-mode for classifying the certain and uncertain dataset in a… Expand
  • figure 1
  • table 6
  • table 6.1
  • figure 6.1
  • figure 6.2
Is this relevant?
2015
2015
Uncertain data contains the specific uncertainty . Uncertain data is usually found in the area of sensor networks . To find the… Expand
Is this relevant?
2015
2015
widespread of geospatial services produces massive volumes of spatial data. Cloud computing is a necessity for big data… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 3
Is this relevant?
2012
2012
  • Ke Yi
  • SIGSPACIAL
  • 2012
  • Corpus ID: 5647802
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… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table I
Is this relevant?
2009
2009
We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 5
Is this relevant?