Results 271 to 280 of about 12,108,065 (316)
Some of the next articles are maybe not open access.
Proceedings of the second international conference on Information and knowledge management - CIKM '93, 1993
We propose new R-tree packing techniques for static databases. Given a collection of rectangles, we sort them and build the R-tree bottom-up. There are several ways to sort the rectangles; the innovation of this work is the use of fractals, and specifically the hilbert curve, to achieve better ordering of the rectangles and eventually better packing ...
Ibrahim Kamel, Christos Faloutsos
openaire +1 more source
We propose new R-tree packing techniques for static databases. Given a collection of rectangles, we sort them and build the R-tree bottom-up. There are several ways to sort the rectangles; the innovation of this work is the use of fractals, and specifically the hilbert curve, to achieve better ordering of the rectangles and eventually better packing ...
Ibrahim Kamel, Christos Faloutsos
openaire +1 more source
Algorithmica, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arge, Lars +2 more
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arge, Lars +2 more
openaire +5 more sources
LAZY R-tree: The R-tree with lazy splitting algorithm
Journal of Information Science, 2019The spatial index is a data structure formed according to the position and shape of the spatial object or the relationship between the spatial objects according to certain rules, and the spatial data is managed by an effective spatial data structure. The quality of a spatial index directly affects the performance of spatial queries.
Yang Yang 0006 +4 more
openaire +1 more source
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
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
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
ACM SIGMOD Record, 1992
We consider the problem of exploiting parallelism to accelerate the performance of spacial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to maximize the throughput of range queries. This can be achieved by (a) maximizing parallelism for large range queries, and (b) by engaging as few disks as ...
Kamel, Ibrahim, Faloutsos, Christos
openaire +1 more source
We consider the problem of exploiting parallelism to accelerate the performance of spacial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to maximize the throughput of range queries. This can be achieved by (a) maximizing parallelism for large range queries, and (b) by engaging as few disks as ...
Kamel, Ibrahim, Faloutsos, Christos
openaire +1 more source