Hilbert R-tree

Hilbert R-tree, an R-tree variant, is an index for multidimensional objects like lines, regions, 3-D objects, or high-dimensional feature-based…

Papers overview

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

2017

Spatial databases improve the spatial query processing by employing spatial indices. Due to the advantages of flash memories over…

2016

Spatial indexing is a core aspect in spatial databases and Geographic Information Systems. Commonly, spatial indices like the R…

2014

The high data availability and the increasing number of GIS users have motivated the emergence of distributed algorithms to…

2013

The kNN join (k nearest neighbor join) is a primitive operation widely adopted by many data mining applications. From a dataset S…

2009

【Abstract】Considering that R-tree is suitable for the dynamic index, its spatial overlap between nodes is great, and Hilbert R…

2005

Multi-level spatial index techniques are always used in the management of large spatial databases.This paper presents a novel 2…

2003

This work investigates the performance of several spatial access methods with respect to the distribution of the indexed spatial…

2003

There have been several techniques proposed for improving the performance of main-memory spatial indexes, but there has not been…

2000

This paper presents a new indexing scheme, the Subspace Coding Method (SCM), that offers high performance similarity retrieval…

1999

,