메뉴 건너뛰기




Volumn 16, Issue 4, 2004, Pages 418-433

Optimizing Similarity Search for Arbitrary Length Time Series Queries

Author keywords

Multiple resolutions; Nearest neighbor query; Range query; Subsequence search; Time series

Indexed keywords

MULTIPLE RESOLUTIONS; NEAREST NEIGHBOR QUERY; RANGE QUERY; SUBSEQUENCE SEARCH;

EID: 2142825698     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2004.1269667     Document Type: Article
Times cited : (30)

References (29)
  • 2
    • 0002644607 scopus 로고
    • Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
    • Sept.
    • R. Agrawal, K. Lin, H.S. Sawhney, and K. Shim, "Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases," Proc. Conf. Very Large Databases, Sept. 1995.
    • (1995) Proc. Conf. Very Large Databases
    • Agrawal, R.1    Lin, K.2    Sawhney, H.S.3    Shim, K.4
  • 3
    • 0025447750 scopus 로고
    • The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Conf., pp. 322-331, 1990.
    • (1990) Proc. ACM SIGMOD Conf. , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 7
    • 0021615874 scopus 로고
    • R-Trees: A Dynamic Index Structure for Spatial Searching
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Conf., pp. 47-57, 1984.
    • (1984) Proc. ACM SIGMOD Conf. , pp. 47-57
    • Guttman, A.1
  • 8
    • 84944324113 scopus 로고    scopus 로고
    • An Efficient Index Structure for String Databases
    • Sept.
    • T. Kahveci and A. Singh, "An Efficient Index Structure for String Databases," Proc. Conf. Very Large Databases, pp. 351-360, Sept. 2001.
    • (2001) Proc. Conf. Very Large Databases , pp. 351-360
    • Kahveci, T.1    Singh, A.2
  • 11
    • 17944378423 scopus 로고    scopus 로고
    • Dimensionality-Reduction for Similarity Searching in Dynamic Databases
    • June
    • K.V.R. Kanth, D. Agrawal, and A. Singh, "Dimensionality-Reduction for Similarity Searching in Dynamic Databases," Proc. ACM SIGMOD Conf., June 1998.
    • (1998) Proc. ACM SIGMOD Conf.
    • Kanth, K.V.R.1    Agrawal, D.2    Singh, A.3
  • 12
  • 16
    • 0033878207 scopus 로고    scopus 로고
    • Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
    • Feb.
    • S. Park, W.W. Chu, J. Yoon, and C. Hsu, "Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases," Proc. Int'l Conf. Data Eng., Feb. 2000.
    • (2000) Proc. Int'l Conf. Data Eng.
    • Park, S.1    Chu, W.W.2    Yoon, J.3    Hsu, C.4
  • 17
    • 0033871047 scopus 로고    scopus 로고
    • Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
    • C.-S. Perng, H. Wang, S.R. Zhang, and D.S. Parker, "Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases," Proc. Int'l Conf. Data Eng., 2000.
    • (2000) Proc. Int'l Conf. Data Eng.
    • Perng, C.-S.1    Wang, H.2    Zhang, S.R.3    Parker, D.S.4
  • 18
    • 0036206371 scopus 로고    scopus 로고
    • Similarity Search over Time-Series Data Using Wavelets
    • I. Popivanov and R.J. Miller, "Similarity Search over Time-Series Data Using Wavelets," Proc. Int'l Conf. Data Eng., pp. 212-221, 2002.
    • (2002) Proc. Int'l Conf. Data Eng. , pp. 212-221
    • Popivanov, I.1    Miller, R.J.2
  • 19
    • 0031170074 scopus 로고    scopus 로고
    • Similarity-Based Queries for Time Series Data
    • D. Rafiei and A. O. Mendelzon, "Similarity-Based Queries for Time Series Data," Proc. ACM SIGMOD Conf., pp. 13-25, 1997.
    • (1997) Proc. ACM SIGMOD Conf. , pp. 13-25
    • Rafiei, D.1    Mendelzon, A.O.2
  • 22
    • 0030197249 scopus 로고    scopus 로고
    • An Analysis of Schedules for Performing Multi-Page Requests
    • B. Seeger, "An Analysis of Schedules for Performing Multi-Page Requests," Information Systems, vol. 21, no. 5, pp. 387-407, 1996.
    • (1996) Information Systems , vol.21 , Issue.5 , pp. 387-407
    • Seeger, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.