A model for the prediction of R-tree performance

Author(s):  
Yannis Theodoridis ◽  
Timos Sellis
Keyword(s):  
1996 ◽  
Vol 24 (1) ◽  
pp. 264-265
Author(s):  
Scott T. Leutenegger ◽  
Mario A. Lopez
Keyword(s):  

2018 ◽  
Vol 234 ◽  
pp. 562-571 ◽  
Author(s):  
Camilo Ordóñez-Barona ◽  
Vadim Sabetski ◽  
Andrew A. Millward ◽  
James Steenberg
Keyword(s):  

2012 ◽  
Vol 143 ◽  
pp. 220
Author(s):  
Tatiana Cantuarias-Avilés ◽  
Francisco de Assis Alves Mourão Filho ◽  
Eduardo Sanches Stuchi ◽  
Simone Rodrigues da Silva ◽  
Erick Espinoza-Núñez

2018 ◽  
Vol 204 ◽  
pp. 126-137 ◽  
Author(s):  
Indira Paudel ◽  
Asher Bar-Tal ◽  
Guy J. Levy ◽  
Nativ Rotbart ◽  
Jhonathan E. Ephrath ◽  
...  

Author(s):  
Todd Eavis

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. Nevertheless, as user queries grow in terms of both size and dimensionality, R-tree performance can deteriorate significantly. Moreover, in the multi-terabyte spaces of today’s enterprise warehouses, the combination of data and indexes ? R-tree or otherwise ? can produce unacceptably large storage requirements. In this chapter, the authors present a framework that addresses both of these concerns. First, they propose a variation of the classic R-tree that specifically targets data warehousing architectures. Their new LBF R-tree not only improves performance on common user-defined range queries, but gracefully degrades to a linear scan of the data on pathologically large queries. Experimental results demonstrate a reduction in disk seeks of more than 50% relative to more conventional R-tree designs. Second, the authors present a fully integrated, block-oriented compression model that reduces the storage footprint of both data and indexes. It does so by exploiting the same Hilbert space filling curve that is used to construct the LBF R-tree itself. Extensive testing demonstrates compression rates of more than 90% for multi-dimensional data, and up to 98% for the associated indexes.


2020 ◽  
Author(s):  
Yuanzhi Li ◽  
Margaret M Mayfield ◽  
Bin Wang ◽  
Junli Xiao ◽  
Kamil Kral ◽  
...  

Abstract It is known that biotic interactions are the key to species coexistence and maintenance of species diversity. Traditional studies focus overwhelmingly on pairwise interactions between organisms, ignoring complex higher-order interactions (HOIs). In this study, we present a novel method of calculating individual-level HOIs for trees, and use this method to test the importance of size- and distance-dependent individual-level HOIs to tree performance in a 25-ha temperate forest dynamic plot. We found that full HOIs-inclusive models improved our ability to model and predict the survival and growth of trees, providing empirical evidence that HOIs strongly influence tree performance in this temperate forest. Specifically, assessed HOIs mitigate the competitive direct effects of neighbours on survival and growth of focal trees. Our study lays a foundation for future investigations of the prevalence and relative importance of HOIs in global forests and their impact on species diversity.


Sign in / Sign up

Export Citation Format

Share Document