Consider a dynamic set of multidimensional objects S, that evolves over time. A temporal membership query asks whether an object with given key attributes was in the set S at some time t. This paper provides efficient solutions to this temporal query. In particular, we present partially persistent extensions to (ⅰ) a hashing based scheme - the BANG file and (ⅱ) the hB~∏-tree. The performance of both methods is compared with a persistent R-tree and an ephemeral R tree. Our experiments show the efficiency of the proposed methods.
展开▼
