Efficient historical R-trees

  • Tao Y
  • Papadias D
  • 26

    Readers

    Mendeley users who have this article in their library.
  • 54

    Citations

    Citations of this article.

Abstract

The historical R-tree (HR-tree) is a spatio-temporal access method
aimed at the retrieval of window queries in the past. The concept behind
the method is to keep an R-tree for each timestamp in history, but to
allow consecutive trees to share branches when the underlying objects do
not change. New branches are only created to accommodate updates from
the previous timestamp. Although existing implementations of HR-trees
process timestamp (window) queries very efficiently, they are hardly
applicable in practice due to excessive space requirements and poor
interval query performance. This paper addresses these problems by
proposing the HR+-tree, which occupies a small fraction of the space
required for the corresponding HR-tree (for typical conditions about
20%), while improving interval query performance several times. Our
claims are supported by extensive experimental evaluation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Yufei Tao

  • Dimitris Papadias

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free