Results 291 to 300 of about 11,560,820 (354)
Some of the next articles are maybe not open access.
Master-client R-trees: a new parallel R-tree architecture
Proceedings. Eleventh International Conference on Scientific and Statistical Database Management, 2003Scientific databases must be able to efficiently run subset retrievals of multidimensional data sets. If the data sets are very large, significant retrieval speedups can be obtained via parallelism. In this paper, we present a new parallel distributed shared-nothing R-tree architecture.
Bernd Schnitzer, Scott T. Leutenegger
openaire +1 more source
International Journal of Computers and Applications, 2009
The problem of finding an optimal splitting of overflowed nodes has a major influence on query performance of the R-tree spatial index structure. Most of the previous split heuristics of R-tree-based index structures have quadratic time and face the problem of increasing overlap of the resulting minimum bounding rectangles (MBRs).
A. Al-Badarneh, M. Tawil
openaire +1 more source
The problem of finding an optimal splitting of overflowed nodes has a major influence on query performance of the R-tree spatial index structure. Most of the previous split heuristics of R-tree-based index structures have quadratic time and face the problem of increasing overlap of the resulting minimum bounding rectangles (MBRs).
A. Al-Badarneh, M. Tawil
openaire +1 more source
22nd International Conference on Data Engineering (ICDE'06), 2006
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one of the dominant choices for indexing multi-dimensional objects, the R-tree exhibits inferior performance in the presence of frequent updates.
Xiong, Xiaopeng, Aref, Walid G.
openaire +2 more sources
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one of the dominant choices for indexing multi-dimensional objects, the R-tree exhibits inferior performance in the presence of frequent updates.
Xiong, Xiaopeng, Aref, Walid G.
openaire +2 more sources
Comparative Analysis of R-Tree and R -Tree in Spatial Database
2014 International Conference on Intelligent Computing Applications, 2014A spatial preference query ranks the objects based on the quality of features in their spatial neighborhood. There are several indexing techniques used in the past for storage and retrieval of spatial data. In this approach, suitable indexing techniques has been applied for multi dimensional spatial objects.
S. Srividhya, S.R. Lavanya
openaire +1 more source
R-Trees and Normalization of Pseudogroups
Experimental Mathematics, 1992Let be a pseudogroup defined on a tree Z, and let Λ be a finite set of generators for . The reduced fundamental group (Λ) of Λ is defined here. I give a new and experimentally inspired proof of a result of Levitt : If (Λ) is a free group, there exists a finite set of generators Ψ for such that is free on the set Ψ.
openaire +1 more source
Concurrent accesses to R-trees
1993Access to spatial objects is often required in many nonstandard database applications, such as GIS, VLSI and CAD. In this paper, we examine the R-tree as an index structure, and modify it to allow concurrent accesses. We investigate three different locking methods for concurrency control.
Vincent Ng 0002, Tiko Kameda
openaire +1 more source
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