Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,291,048 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Database
Hilbert curve
List of data structures
Minimum bounding rectangle
Expand
Broader (1)
R-tree
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Analyzing the Performance of Spatial Indices on Flash Memories using a Flash Simulator
A. Carniel
,
Tamires Brito Da Silva
,
Kairo Luiz dos Santos Bonicenha
,
R. R. Ciferri
,
C. D. Ciferri
Brazilian Symposium on Databases
2017
Corpus ID: 3420315
Spatial databases improve the spatial query processing by employing spatial indices. Due to the advantages of flash memories over…
Expand
2016
2016
The performance relation of spatial indexing on hard disk drives and solid state drives
A. Carniel
,
R. R. Ciferri
,
C. D. Ciferri
Brazilian Symposium on GeoInformatics
2016
Corpus ID: 29717073
Spatial indexing is a core aspect in spatial databases and Geographic Information Systems. Commonly, spatial indices like the R…
Expand
2016
2016
The Hilbert PDC-tree: A High-Velocity Structure for Many-Dimensional Data
D. Robillard
,
F. Dehne
,
A. Rau-Chaplin
,
Neil Burke
International Database Engineering and…
2016
Corpus ID: 17543146
Fast aggregation of data with many dimensions is a key component of many applications. The R-tree is the traditional data…
Expand
2009
2009
Hilbert R-tree Spatial Index Algorithm Based on Clustering
R. Hilbert
,
HE Xiao-yuan
,
Min Hua-qing
2009
Corpus ID: 123186168
【Abstract】Considering that R-tree is suitable for the dynamic index, its spatial overlap between nodes is great, and Hilbert R…
Expand
2005
2005
2-Level R-tree Spatial Index Based on Spatial Grids and Hilbert R-tree
Guo Jing
,
Liu Guangjun
,
Dong Xu-rong
,
Guo Lei
2005
Corpus ID: 123736470
Multi-level spatial index techniques are always used in the management of large spatial databases.This paper presents a novel 2…
Expand
2003
2003
Performance Evaluation of Main-Memory R-tree Variants
Sangyong Hwang
,
Keunjoo Kwon
,
S. Cha
,
B. Lee
International Symposium on Spatial and Temporal…
2003
Corpus ID: 15849057
There have been several techniques proposed for improving the performance of main-memory spatial indexes, but there has not been…
Expand
2003
2003
A performance comparison among the traditional R-trees, the Hilbert R-tree and the SR-tree
R. R. Ciferri
,
A. Salgado
,
V. Times
,
M. Nascimento
,
G. C. Magalhães
23rd International Conference of the Chilean…
2003
Corpus ID: 40267696
This work investigates the performance of several spatial access methods with respect to the distribution of the indexed spatial…
Expand
2002
2002
On multi-scale display of geometric objects
Edward P. F. Chan
,
K. Chow
Data & Knowledge Engineering
2002
Corpus ID: 33766355
2000
2000
The subspace coding method: a new indexing scheme for high-dimensional data
Yasushi Sakurai
,
Masatoshi Yoshikawa
,
Shunsuke Uemura
,
Haruhiko Kojima
International Conference on Information and…
2000
Corpus ID: 7418031
This paper presents a new indexing scheme, the Subspace Coding Method (SCM), that offers high performance similarity retrieval…
Expand
Highly Cited
1998
Highly Cited
1998
The pyramid-technique: towards breaking the curse of dimensionality
Stefan Berchtold
,
Christian Böhm
,
H. Kriegel
ACM SIGMOD Conference
1998
Corpus ID: 207225997
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The Pyramid-Technique is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE