Tout DSpace

Parcourir par sujet "Trees (mathematics)"

Voici les éléments 21-24 de 24

    • Predictive join processing between regions and moving objects 

      Corral, A.; Torres, M.; Vassilakopoulos, M.; Manolopoulos, Y. (2008)
      The family of R-trees is suitable for indexing various kinds of multidimensional objects. TPR*-trees are R-tree based structures that have been proposed for indexing a moving object database, e.g. a data-base of moving ...

    • Spatial batch-queries processing using xBR+-trees in Solid-State Drives 

      Roumelis G., Vassilakopoulos M., Corral A., Fevgas A., Manolopoulos Y. (2018)
      Efficient query processing in spatial databases is of vital importance for numerous modern applications. In most cases, such processing is accomplished by taking advantage of spatial indexes. The xBR+ -tree is an index for ...

    • A statistically-based engine for P/G network optimization 

      Karampatzakis, D. P.; Evmorfopoulos, N. E.; Stamoulis, G. I. (2005)
      The problem of optimum design of general (tree or graph-based) power distribution networks with respect to the voltage drop effect is addressed in this paper. A rigorous formulation based on linear circuit theory is ...

    • A Study of R-tree Performance in Hybrid Flash/3DXPoint Storage 

      Fevgas A., Akritidis L., Alamaniotis M., Tsompanopoulou P., Bozanis P. (2019)
      The flash based solid state drives have become the storage medium of choice for many applications, replacing traditional HDDs in almost any data center. Their advent has motivated many research efforts in data management. ...