Sort-based query-adaptive loading of R-trees

  title={Sort-based query-adaptive loading of R-trees},
  author={Daniar Achakeev and Bernhard Seeger and Peter Widmayer},
Bulk-loading of R-trees has been an important problem in academia and industry for more than twenty years. Current algorithms create R-trees without any information about the expected query profile. However, query profiles are extremely useful for the design of efficient indexes. In this paper, we address this deficiency and present query-adaptive algorithms for building R-trees optimally designed for a given query profile. Since optimal R-tree loading is NP-hard (even without tuning the… CONTINUE READING


Publications referenced by this paper.
Showing 1-4 of 4 references

Similar Papers

Loading similar papers…