Indexing continuously changing data with mean-variance tree

Document Type

Article

Publication Date

12-1-2008

Abstract

Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption is no longer true since data updates can be numerous and frequent. As a result these indexes can suffer from a high update overhead, leading to poor performance. In this paper we propose a novel index structure, the Mean Variance Tree (MVTree), which is built based on the mean and variance of the data instead of the actual data values that can change continuously. Since the mean and variance are relatively stable features compared to the actual values, the MVTree significantly reduces the index update cost. The mean and the variance of the data item can be dynamically adjusted to match the observed fluctuation of the data. Our experiments show that the MVTree substantially improves index update performance while maintaining satisfactory query performance. Copyright © 2008, Inderscience Publishers.

Publication Source (Journal or Book title)

International Journal of High Performance Computing and Networking

First Page

263

Last Page

272

This document is currently not available here.

Share

COinS