메뉴 건너뛰기




Volumn , Issue , 2000, Pages 385-394

Fast time sequence indexing for arbitrary 4 norms

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE FUNCTIONS; EUCLIDEAN DISTANCE; INDEX STRUCTURE; SIMILARITY MODELS; SIMILARITY SEARCH; SIMILARITY SEARCHING; STATE OF THE ART; TIME SEQUENCES;

EID: 0008693810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (538)

References (25)
  • 2
    • 0001818178 scopus 로고
    • Efficient similarity search in sequence databases
    • Evansotn, IL, October
    • [I] R.Agrawal, C.Faloutsos, and A.Swami.Efficient similarity search in sequence databases.In Proc.of the FODO Conf, Evansotn, IL, October 1993.
    • (1993) Proc.of the FODO Conf
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.3
  • 3
    • 0002644607 scopus 로고
    • Fast similarity search in the presence of noise, scaling, and translation in time-series database
    • Zurich, Switzerland
    • R.Agrawal, K.-I.Lin, H.S.Sawhney, and K.Shim.Fast similarity search in the presence of noise, scaling, and translation in time-series database.In Proc.of the VLDB Conf., Zurich, Switzerland, 1995.
    • (1995) Proc.of the VLDB Conf
    • Agrawal, R.1    Lin, K.-I.2    Sawhney, H.S.3    Shim, K.4
  • 4
    • 0025447750 scopus 로고
    • The rtree: An efficient and robust access method for points and rectangles
    • Atlantic City, NJ, May
    • N.Beckmann, H-p.Kriegel, R.Schneider, and B.Seeger.The R-Tree: an Efficient and Robust Access Method for Points and Rectangles.In Proc.ACM SIGMOD Conf, pages 322 - 331, Atlantic City, NJ, May 199O
    • (1990) Proc.ACM SIGMOD Conf , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 5
    • 0001802606 scopus 로고    scopus 로고
    • The x-tree: An index structure for high-dimensional data
    • Bombay, India
    • S.Berchtold, D.A.Keim, and H-P.Kriegel.The X-tree: An Index Structure for High-Dimensional Data.In Proc.VLDB Conf., Bombay, India, 1996.
    • (1996) Proc.VLDB Conf
    • Berchtold, S.1    Keim, D.A.2    Kriegel, H.-P.3
  • 6
  • 9
    • 84976803260 scopus 로고
    • Fastmap: A fast algorithm for indexing data-mining and visualization of traditional and multimedia datasets
    • May
    • C.Faloutsos and K-li.Lin.FastMap: a Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets.Proc.of AcM-SIGMOD.pages 163 - 174, May 1995.
    • (1995) Proc.Of AcM-SIGMOD , pp. 163-174
    • Faloutsos, C.1    Lin, K.-L.2
  • 11
    • 0001944742 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • Edinburgh, Scotland
    • [101 A.Gionis, P.Indyk, and R.Motwani.Similarity Search in High Dimensions via Hashing.In Proc.of VLDB Conf, Edinburgh, Scotland.1999.
    • (1999) Proc.of VLDB Conf
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 12
    • 0001304381 scopus 로고
    • On similarity queries for time-series data: Constraint specification and implementation
    • Marseilles, France, September
    • [II] D.Q.Goldin and P.C.Kanellakis.On similarity queries for time-series data: Constraint specification and implementa.tion.In Proc.of Constraint Programming 95, Marseilles, France, September 1995.
    • (1995) Proc.of Constraint Programming , vol.95
    • Goldin, D.Q.1    Kanellakis, P.C.2
  • 13
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, Mass, Jun
    • [121 A.Guttman.R-Trees: a Dynamic Index Structure for Spatial Searching.In Proc.ACM SIGMOD Conf, pages 47 - 57, Boston, Mass, Jun 1984.
    • (1984) Proc.ACM SIGMOD Conf , pp. 47-57
    • Guttman, A.1
  • 16
    • 0029776278 scopus 로고    scopus 로고
    • Hierarchyscan: A hierarchical similarity search algorithm for databases of long sequences
    • New Orleans, LA
    • C-S.Li, p.S.Yu, and V.Castelli.HierarchyScan: A Hierarchical Similarity Search Algorithm for Databases of Long Sequences.In Proc.of ICDE, pages 546 - 553, New Orleans, LA, 1996.
    • (1996) Proc.of ICDE , pp. 546-553
    • Li, C.-S.1    Yu, S.2    Castelli, V.3
  • 17
    • 0001555767 scopus 로고    scopus 로고
    • Warlus: A similarity retrieval algorithms for image databases
    • Philadelphia, PA
    • A.Natsev, R.Rastogi, and K.Shim.WARLUS: A Similarity Retrieval Algorithms for Image Databases.In Proc.of ACM SIGMOD C'onf, pages 395-406, Philadelphia, PA, 1999.
    • (1999) Proc.of ACM SIGMOD C'onf , pp. 395-406
    • Natsev, A.1    Rastogi, R.2    Shim, K.3
  • 20
    • 0031170074 scopus 로고    scopus 로고
    • Similarity -based queries for time series data
    • Tucson, AZ, May
    • (19] D.Rafiei and A.Mendelzon.Similarity -based queries for time series data.In Proc.of the ACM SIGMOD Conf, Tucson, AZ, May 1997.
    • (1997) Proc.of the ACM SIGMOD Conf
    • Rafiei, D.1    Mendelzon, A.2
  • 22
    • 0000561280 scopus 로고
    • The r+ tree: A dynamic index for multi-dimensional objects
    • T.Sellis, N.Roussopoulos, and C.Faloutsos.The R+ Tree: a Dynamic Index for Multi-Dimensional Objects.In Proc.VLDB Conf, pages 507 - 5 18, 1987,
    • (1987) Proc.VLDB Conf , pp. 507-518
    • Sellis, T.1    Roussopoulos, N.2    Faloutsos, C.3
  • 23
    • 0033101908 scopus 로고    scopus 로고
    • Mathematical programming algorithms for regression-based non-linear filtering
    • Mar
    • N.D.Sidiropoulos and R.Bros.Mathematical Programming Algorithms for Regression-based Non-linear Filtering in R;.IEEE Trans.on Signal Processing, Mar 1999.
    • IEEE Trans.on Signal Processing , vol.199 , Issue.9
    • Sidiropoulos, N.D.1    Bros, R.2
  • 24
    • 0347087667 scopus 로고    scopus 로고
    • Approximate computation of multidimensional aggregates of sparse data using wavelets
    • Philadelphia, PA
    • J.S.Vitter and M.Wang.Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.In Proc.ofACMS!GMOD C'onf, pages 193 - 204, Philadelphia, PA, 1999.
    • (1999) Proc.ofACMS!GMOD C'onf , pp. 193-204
    • Vitter, J.S.1    Wang, M.2


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