Results 281 to 290 of about 11,560,820 (354)
Diameter-driven variation in wood CO2 efflux across the stems and crowns of three temperate broadleaf tree species. [PDF]
Tree PhysiolWalker K, Shenkin A, Malhi Y.
europepmc +1 more source
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 +2 more sources
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 +2 more sources
Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004., 2004 R-trees, since their introduction in 1984, have been proven to be one of the most well-behaved practical data structures for accommodating dynamic massive sets of geometric objects and conducting a diverse set of queries on such data-sets in real-world ...
Vasilis Vasaitis +2 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mapping trees along urban street networks with deep learning and street-level imagery
, 2021Planning and managing urban forests for livable cities remains a challenge worldwide owing to sparse information on the spatial distribution, structure and composition of urban trees and forests.
S. Lumnitz +5 more
semanticscholar +1 more source
IEEE Transactions on Knowledge and Data Engineering, 2013
We consider the recoverability of traditional R-tree index structures under concurrent updating transactions, an important issue that is neglected or treated inadequately in many proposals of R-tree concurrency control. We present two solutions to ARIES-based recovery of transactions on R-trees.
Haapasalo, Tuukka +4 more
openaire +3 more sources
We consider the recoverability of traditional R-tree index structures under concurrent updating transactions, an important issue that is neglected or treated inadequately in many proposals of R-tree concurrency control. We present two solutions to ARIES-based recovery of transactions on R-trees.
Haapasalo, Tuukka +4 more
openaire +3 more sources
Hilbert R-tree: An Improved R-tree using Fractals [PDF]
, 2018 We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the R-tree nodes. This ordering has to be `good', in the sense that it should group `similar' data rectangles together, to minimize the area and perimeter of ...
Kamel, Ibrahim, Faloutsos, Christos
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