Abstract
In this paper we propose a formal approach that transforms a high-dimensional MBR itself to a low-dimensional MBR directly, and show that the approach significantly reduces the number of lower-dimensional transformations in similar sequence matching. To achieve this goal, we first formally define a new notion of MBR-safe. We say that a transform is MBR-safe if it constructs a low-dimensional MBR by containing all the low-dimensional sequences to which an infinite number of high-dimensional sequences in an MBR are transformed. We then propose an MBR-safe transform based on DFT. For this, we prove the original DFT-based lower-dimensional transformation is not MBR-safe and define a new transform, called mbrDFT, by extending definition of DFT. We also formally prove this mbrDFT is MBR-safe. Analytical and experimental results show that our mbrDFT reduces the number of lower-dimensional transformations drastically and improves performance significantly compared with the traditional method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 69–84. Springer, Heidelberg (1993)
Chan, K.-P., Fu, A.W.-C., Yu, C.T.: Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping. IEEE Trans. on Knowledge and Data Engineering 15(3), 686–705 (2003)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, May 1994, pp. 419–429 (1994)
Gao, L., Wang, X.S.: Continually Evaluating Similarity-based Pattern Queries on a Streaming Time Series. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, June 2002, pp. 370–381 (2002)
Keogh, E.J., Chakrabarti, K., Mehrotra, S., Pazzani, M.J.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. In: Proc. of Int’l Conf. on Management of Data, ACM SIGMOD, May 2001, pp. 151–162 (2001)
Korn, F., Jagadish, H.V., Faloutsos, C.: Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. In: Proc. of Int’l Conf. on Management of Data, ACM SIGMOD, June 1997, pp. 289–300 (1997)
Lim, S.-H., Park, H.-J., Kim, S.-W.: Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases. In: Lee, M.L., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 65–79. Springer, Heidelberg (2006)
Moon, Y.-S., Whang, K.-Y., Han, W.-S.: General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, June 2002, pp. 382–393 (2002)
Moon, Y.-S., Kim, J.-H.: A Single Index Approach for Time-Series Subsequence Matching That Supports Moving Average Transform of Arbitrary Order. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 739–749. Springer, Heidelberg (2006)
Natsev, A., Rastogi, R., Shim, K.: WALRUS: A Similarity Retrieval Algorithm for Image Databases. IEEE Trans. on Knowledge and Data Engineering 16(3), 301–316 (2004)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: The Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moon, YS. (2007). An MBR-Safe Transform for High-Dimensional MBRs in Similar Sequence Matching. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)