Results 221 to 230 of about 269,449 (266)
Some of the next articles are maybe not open access.
On R-Trees with Low Stabbing Number
2000The R-tree is a well-known bounding-volume hierarchy that is suitable for storing geometric data on secondary memory. Unfortunately, no good analysis of its query time exists. We describe a new algorithm to construct an R-tree for a set of planar objects that has provably good query complexity for point location queries and range queries with ranges of
Berg, de, M. +3 more
openaire +2 more sources
ACM SIGMOD Record, 1984
In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data objects of non-zero size located m multi-dimensional ...
openaire +1 more source
In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data objects of non-zero size located m multi-dimensional ...
openaire +1 more source
Revisiting R-Tree Construction Principles
2002Spatial indexing is a well researched field that benefited computer science with many outstanding results. Our effort in this paper can be seen as revisiting some outstanding contributions to spatial indexing, questioning some paradigms, and designing an access method with globally improved performance characteristics.
Sotiris Brakatsoulas +2 more
openaire +2 more sources
A performance comparison among the traditional R-trees, the hilbert R-tree and the SR-tree
23rd International Conference of the Chilean Computer Science Society, 2003. SCCC 2003. Proceedings., 2004This work investigates the performance of several spatial access methods with respect to the distribution of the indexed spatial objects. Although having gathered storage and insertion costs as well this work focuses on some issues regarding query costs. The performance results have showed that the R/sup +/-tree was the best spatial index structure for
Ricardo Rodrigues Ciferri +4 more
openaire +1 more source
Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004., 2004
Vasilis Vasaitis +2 more
openaire +2 more sources
Vasilis Vasaitis +2 more
openaire +2 more sources
2010
In multi-dimensional database environments, such as those typically associated with contemporary data warehousing, we generally require effective indexing mechanisms for all but the smallest data sets. While numerous such methods have been proposed, the R-tree has emerged as one of the most common and reliable indexing models.
openaire +1 more source
In multi-dimensional database environments, such as those typically associated with contemporary data warehousing, we generally require effective indexing mechanisms for all but the smallest data sets. While numerous such methods have been proposed, the R-tree has emerged as one of the most common and reliable indexing models.
openaire +1 more source
Informatica (Slovenia), 2000
Informatica (Ljubljana) ; 24 ; 2 ; 205-209 ...
Ang, C.H., Tan, S.T., Tan, T.C.
openaire
Informatica (Ljubljana) ; 24 ; 2 ; 205-209 ...
Ang, C.H., Tan, S.T., Tan, T.C.
openaire