Skip to main content

Indexing and Querying Constantly Evolving Data Using Time Series Analysis

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3453))

Included in the following conference series:

  • 1051 Accesses

Abstract

This paper introduces a new approach for efficiently indexing and querying constantly evolving data. Traditional data index structures suffer from frequent updating cost and result in unsatisfactory performance when data changes constantly. Existing approaches try to reduce index updating cost by using a simple linear or recursive function to define the data evolution, however, in many applications, the data evolution is far too complex to be accurately described by a simple function. We propose to take each constantly evolving data as a time series and use the ARIMA (Autoregressive Integrated Moving Average) methodology to analyze and model it. The model enables making effective forecasts for the data. The index is developed based on the forecasting intervals. As long as the data changes within its corresponding forecasting interval, only its current value in the leaf node needs to be updated and no further update needs to be done to the index structure. The model parameters and the index structure can be dynamically adjusted. Experiments show that the forecasting interval index (FI-Index) significantly outperforms traditional indexes in a high updating environment.

Portions of this work were supported by NSF CAREER grant IIS-9985019, NSF grant 0010044-CCR, NSF grant 9988339-CCR.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Saltenis, S., Jensen, C., Leutenegger, S., Lopez., M.: Indexing the position of continuously moving objects. In: Proceedings of ACM SIGMOD Conference, pp. 261–272 (2000)

    Google Scholar 

  2. Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An optimized spatio-temporal access method for predictive queries. In: Proceedings of the 29th International Conference on Very Large Databases (VLDB), pp. 790–802 (2003)

    Google Scholar 

  3. Tao, Y., Faloutsos, C., Papadias, D., Liu, B.: Prediction and indexing of moving objects with unknown motion patterns. In: Proceedings of the SIGMOD, pp. 611–622 (2004)

    Google Scholar 

  4. Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects, 261–272 (1999)

    Google Scholar 

  5. Tayeb, J., Ulusoy, O., Wolfson., O.: A Quadtree-based dynamic attribute indexing method. The Computer Journal, 185–200 (1998)

    Google Scholar 

  6. Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points, 175–186 (2000)

    Google Scholar 

  7. Kwon, D., Lee, S.J., Lee, S.: Indexing the current positions of moving objects using the lazy update R-tree. In: The 3rd International Conference on Mobile Data Management (2002)

    Google Scholar 

  8. Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in R-trees: A bottom-up approach. In: Proceedings of the 29th International Conference on Very Large Databases (VLDB), pp. 608–620 (2003)

    Google Scholar 

  9. Box, G.E., Jenkins, G.M., Reinsel, G.C.: Time Series Analysis Forecasting and Control. Prentice Hall, Englewood Cliffs (2004)

    Google Scholar 

  10. Tran, N., Reed, D.A.: Arima time series modeling and forecasting for adaptive I/O prefetching. In: Proceedings of the 2001 International Conference on Supercomputing, pp. 473–485 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, Y., Prabhakar, S., Sun, J., Lei, S. (2005). Indexing and Querying Constantly Evolving Data Using Time Series Analysis. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_59

Download citation

  • DOI: https://doi.org/10.1007/11408079_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25334-1

  • Online ISBN: 978-3-540-32005-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics