Research group

Machine Learning and Information Management Lab

R-tree re-evaluation project

Project supervisor: George Chernishev
Status: Active

R-tree is a classic data structure used for indexing low-dimensionality data. This data structure can be used to speed-up queries like “find all stars in a given sky sector” or “find nearest restaurant”. In this project we are mainly interested in experimental evaluation of existing node split algorithms.

Participants

Publications

  • Valentin Grigorev and George Chernishev
    In Proceedings of the 2016 International Conference on Management of Data (SIGMOD '16). ACM, New York, NY, USA, 2251-2252.,
  • Ilya Shkuratov and George Chernishev
    A parallel R-tree bulk-loading for shared-memory architecture
    In proceedings of CIMSP'15,
  • Fedotovsky P.V., Cherednik K.E., Chernishev G.A.
    To sort or not to sort: the evaluation of R-Tree and B+-Tree in transactional environment with ordered result requirement
    Труды Института системного программирования РАН. – Т. 26. – №. 4.,
  • Kirill Smirnov, George Chernishev, Pavel Fedotovsky, George Erokhin and Kirill Cherednik
    R-tree re-evaluation effort: a report
    Technical report,
  • Chernishev G.
    To Sort or not to Sort: The Evaluation of R-Tree and B+-Tree in Transactional Environment with Ordered Result Set Requirement
    SYRCoDIS. – Т. 1031. – С. 27-34.,