{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:12Z","timestamp":1779174852879,"version":"3.51.4"},"reference-count":165,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,11]]},"abstract":"<jats:p>Data series are a special type of multidimensional data present in numerous domains, where similarity search is a key operation that has been extensively studied in the data series literature. In parallel, the multidimensional community has studied approximate similarity search techniques. We propose a taxonomy of similarity search techniques that reconciles the terminology used in these two domains, we describe modifications to data series indexing techniques enabling them to answer approximate similarity queries with quality guarantees, and we conduct a thorough experimental evaluation to compare approximate similarity search techniques under a unified framework, on synthetic and real datasets in memory and on disk. Although data series differ from generic multidimensional vectors (series usually exhibit correlation between neighboring values), our results show that data series techniques answer approximate queries with strong guarantees and an excellent empirical performance, on data series and vectors alike. These techniques outperform the state-of-the-art approximate techniques for vectors when operating on disk, and remain competitive in memory.<\/jats:p>","DOI":"10.14778\/3368289.3368303","type":"journal-article","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T03:17:35Z","timestamp":1599794255000},"page":"403-420","source":"Crossref","is-referenced-by-count":56,"title":["Return of the Lernaean Hydra"],"prefix":"10.14778","volume":"13","author":[{"given":"Karima","family":"Echihabi","sequence":"first","affiliation":[{"name":"Mohammed V Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Zoumpatianos","sequence":"additional","affiliation":[{"name":"Harvard University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Palpanas","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Paris"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houda","family":"Benbrahim","sequence":"additional","affiliation":[{"name":"Mohammed V Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"http:\/\/fcon_1000.projects.nitrc.org\/indi\/adhd200\/","year":"2018"},{"key":"e_1_2_1_2_1","volume-title":"http:\/\/www.mi.parisdescartes.fr\/~themisp\/dsseval\/","author":"Archive Lernaean Hydra","year":"2018"},{"key":"e_1_2_1_3_1","volume-title":"https:\/\/www.sdss3.org\/dr10\/data_access\/volume.php","author":"Sky Survey Sloan Digital","year":"2018"},{"key":"e_1_2_1_4_1","volume-title":"https:\/\/github.com\/facebookresearch\/faiss\/","year":"2019"},{"key":"e_1_2_1_5_1","volume-title":"https:\/\/github.com\/nmslib\/hnswlib","author":"Hnswlib","year":"2019"},{"key":"e_1_2_1_6_1","volume-title":"http:\/\/www.mi.parisdescartes.fr\/~themisp\/dsseval2\/","author":"Lernaean Hydra","year":"2019"},{"key":"e_1_2_1_7_1","first-page":"69","volume-title":"Efficient similarity search in sequence databases","author":"Agrawal R.","year":"1993"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.1997.628089"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1459693.1459731"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2000.869779"},{"key":"e_1_2_1_11_1","volume-title":"Approximate Nearest Neighbor Search in High Dimensions. CoRR, abs\/1806.09823","author":"Andoni A.","year":"2018"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020576"},{"issue":"8","key":"e_1_2_1_13_1","first-page":"906","article-title":"HD-index: Pushing the Scalability-accuracy Boundary for Approximate kNN Search","volume":"11","author":"Arora A.","year":"2018","journal-title":"High-dimensional Spaces. PVLDB"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313768"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/11687238_19","volume-title":"10th International Conference on Extending Database Technology, Munich, Germany, March 26--31, 2006","author":"A\u00dffalg J.","year":"2006"},{"key":"e_1_2_1_16_1","first-page":"435","volume-title":"21st International Conference, SSDBM 2009, New Orleans, LA, USA, June 2--4, 2009","author":"A\u00dffalg J.","year":"2009"},{"key":"e_1_2_1_17_1","first-page":"34","volume-title":"SISAP 2017, Munich, Germany, October 4--6, 2017","author":"Aum\u00fcller M.","year":"2017"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/we.2057"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0483-9"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398596"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_1_24_1","first-page":"78","volume-title":"Kriegel. A Cost Model for Nearest Neighbor Search in High-dimensional Data Space. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '97","author":"Berchtold S.","year":"1997"},{"key":"e_1_2_1_25_1","first-page":"142","volume-title":"Kriegal. The Pyramid-technique: Towards Breaking the Curse of Dimensionality. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD '98","author":"Berchtold S.","year":"1998"},{"key":"e_1_2_1_26_1","first-page":"28","volume-title":"Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22th International Conference on Very Large Data Bases, VLDB '96","author":"Berchtold S.","year":"1996"},{"key":"e_1_2_1_27_1","first-page":"359","volume-title":"AAAIWS","author":"Berndt D. J.","year":"1994"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00182"},{"key":"e_1_2_1_29_1","first-page":"21","volume-title":"On the Resemblance and Containment of Documents. In Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES '97","author":"Broder A."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345543"},{"issue":"1","key":"e_1_2_1_31_1","first-page":"115","volume":"2","author":"Bustos B.","year":"2004","journal-title":"Probabilistic Proximity Searching Algorithms Based on Compact Partitions. J. of Discrete Algorithms"},{"key":"e_1_2_1_32_1","first-page":"58","volume-title":"ICDM","author":"Camerra A.","year":"2010"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0606-6"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568520"},{"key":"e_1_2_1_35_1","volume-title":"Anomaly detection: A survey. ACM Computing Surveys (CSUR), 41(3):15","author":"Chandola V.","year":"2009"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15992-3_29"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70815"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577096"},{"key":"e_1_2_1_40_1","volume-title":"July","author":"Chen Y.","year":"2015"},{"key":"e_1_2_1_41_1","first-page":"786","volume-title":"Tung. SpADe: On Shape-based Pattern Detection in Streaming Time Series. In Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel","author":"Chen Y.","year":"2007"},{"key":"e_1_2_1_42_1","unstructured":"P. Ciaccia and M. Patella. the power of distance distributions: Cost models and scheduling policies for quality-controlled similarity queries.  P. Ciaccia and M. Patella. the power of distance distributions: Cost models and scheduling policies for quality-controlled similarity queries."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847295"},{"key":"e_1_2_1_44_1","first-page":"426","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB'97)","author":"Ciaccia P.","year":"1997"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275495"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081966"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081966"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350278"},{"issue":"1","key":"e_1_2_1_49_1","first-page":"13","volume":"8","author":"Dallachiesa M.","year":"2014","journal-title":"Top-k Nearest Neighbor Search in Uncertain Data Series. PVLDB"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/645801.669017"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454226"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the VLDB 2019 PhD Workshop, co-located with the 45th International Conference on Very Large Databases (VLDB 2019","author":"Echihabi K.","year":"2019"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282498"},{"key":"e_1_2_1_55_1","unstructured":"ESA. SENTINEL-2 Mission 2018.  ESA. SENTINEL-2 Mission 2018."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191925"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354820"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(86)90013-7"},{"key":"e_1_2_1_59_1","unstructured":"I. R. I. for Seismology with Artificial Intelligence. Seismic Data Access. http:\/\/ds.iris.edu\/data\/access\/ 2018.  I. R. I. for Seismology with Artificial Intelligence. Seismic Data Access. http:\/\/ds.iris.edu\/data\/access\/ 2018."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the Workshops of the EDBT\/ICDT 2019 Joint Conference, EDBT\/ICDT 2019","author":"Gogolou A.","year":"2019"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.1910400211"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_68_1","volume-title":"Physica-Verlag HD","author":"H\u00e9brail G.","year":"2000"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.5555\/647224.718930"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.66"},{"issue":"1","key":"e_1_2_1_71_1","first-page":"1","volume":"9","author":"Huang Q.","year":"2015","journal-title":"Query-aware Locality-sensitive Hashing for Approximate Nearest Neighbor Search. PVLDB"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2326100"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27671-7_27"},{"key":"e_1_2_1_77_1","volume-title":"Conference in modern analysis and probability","volume":"26","author":"Johnson W.","year":"1982"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1998.10474114"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.757470"},{"key":"e_1_2_1_81_1","first-page":"1334","volume-title":"Scalable kNN search on vertically stored time series","author":"Kashyap S.","year":"2011"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011669"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024988512476"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.5555\/3000292.3000335"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.5555\/3001392.3001397"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_87_1","first-page":"42","article-title":"An online adaptive screening procedure for selective neuronal responses","author":"Knieling S.","year":"2017","journal-title":"Journal of Neuroscience Methods, 291(Supplement C):36 --"},{"issue":"6","key":"e_1_2_1_88_1","first-page":"677","article-title":"Coconut","volume":"11","author":"Kondylakis H.","year":"2018","journal-title":"PVLDB"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"e_1_2_1_90_1","volume-title":"Coconut: Sortable summarizations for scalable indexes over static and streaming data series. VLDBJ, accepted for publication","author":"Kondylakis H.","year":"2019"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01889706"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775129"},{"key":"e_1_2_1_93_1","article-title":"Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement","author":"Li W.","year":"2019","journal-title":"IEEE Transactions on Knowledge and Data Engineering, pages 1--1"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882086"},{"issue":"13","key":"e_1_2_1_95_1","first-page":"2236","article-title":"Scalable, variable-length similarity search in data series: The ulisse approach","volume":"11","author":"Linardi M.","year":"2018","journal-title":"PVLDB"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00149"},{"key":"e_1_2_1_97_1","doi-asserted-by":"crossref","DOI":"10.1145\/3183713.3183744","volume-title":"Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series","author":"Linardi M.","year":"2018"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.5555\/2976040.2976144"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732947"},{"key":"e_1_2_1_100_1","first-page":"950","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB '07","author":"Lv Q.","year":"2007"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.actaastro.2006.08.015"},{"issue":"61","key":"e_1_2_1_102_1","first-page":"68","article-title":"Approximate nearest neighbor algorithm based on navigable small world graphs","volume":"45","author":"Malkov Y.","year":"2014","journal-title":"Information Systems"},{"key":"e_1_2_1_103_1","volume-title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. CoRR, abs\/1603.09320","author":"Malkov Y. A.","year":"2016"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193547"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.3169\/mta.6.2"},{"key":"e_1_2_1_107_1","first-page":"551","volume-title":"EDBT","author":"Mirylenka K.","year":"2016"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085515"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646858"},{"key":"e_1_2_1_110_1","volume-title":"August","author":"Mueen A.","year":"2017"},{"key":"e_1_2_1_111_1","first-page":"331","volume-title":"VISAPP International Conference on Computer Vision Theory and Applications","author":"Muja M.","year":"2009"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824059"},{"key":"e_1_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"e_1_2_1_114_1","first-page":"3017","volume-title":"Cartesian K-Means. In Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition, CVPR '13","author":"Norouzi M.","year":"2013"},{"key":"e_1_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578221"},{"key":"e_1_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335219"},{"key":"e_1_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814710.2814719"},{"key":"e_1_2_1_118_1","doi-asserted-by":"crossref","unstructured":"T.\n      Palpanas\n    . \n      Big Sequence\n      Management\n  : \n  A glimpse of the Past the Present and the Future\n  . In R. M. Freivalds G. Engels and B. Catania editors SOFSEM volume \n  9587\n   of \n  Lecture Notes in Computer Science pages \n  63\n  --\n  80\n  . \n  Springer 2016\n  .  T. Palpanas. Big Sequence Management: A glimpse of the Past the Present and the Future. In R. M. Freivalds G. Engels and B. Catania editors SOFSEM volume 9587 of Lecture Notes in Computer Science pages 63--80. Springer 2016.","DOI":"10.1007\/978-3-662-49192-8_6"},{"key":"e_1_2_1_119_1","volume-title":"Report on the first and second interdisciplinary time series analysis workshop (itisa). SIGMOD Rec., \"Accepted for publication","author":"Palpanas T.","year":"2019"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"e_1_2_1_121_1","volume-title":"D4D Challenge session","author":"Paraskevopoulos P.","year":"2013"},{"key":"e_1_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622293"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00036"},{"key":"e_1_2_1_124_1","first-page":"410","volume-title":"On Similarity-Based Queries for Time Series Data. In Proceedings of the 15th International Conference on Data Engineering","author":"Rafiei D.","year":"1999"},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253264"},{"key":"e_1_2_1_126_1","volume-title":"Efficient Retrieval of Similar Time Sequences Using DFT. CoRR, cs.DB\/9809033","author":"Rafiei D.","year":"1998"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339576"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.146"},{"issue":"8","key":"e_1_2_1_129_1","volume":"27","author":"Raza U.","year":"2015","journal-title":"Practical Data Prediction for Real-World Wireless Sensor Networks. IEEE Trans. Knowl. Data Eng."},{"key":"e_1_2_1_130_1","first-page":"499","volume-title":"ODAC: Hierarchical Clustering of Time Series Data Streams","author":"Rodrigues P. P.","year":"2006"},{"key":"e_1_2_1_131_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25087-8_10"},{"key":"e_1_2_1_132_1","volume-title":"USA","author":"Samet H.","year":"2005"},{"key":"e_1_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835854"},{"key":"e_1_2_1_134_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247656"},{"issue":"2","key":"e_1_2_1_135_1","first-page":"40","article-title":"Tuning Time Series Queries in Finance","volume":"22","author":"Shasha D.","year":"1999","journal-title":"Case Studies and Recommendations. IEEE Data Eng. Bull."},{"key":"e_1_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.653263"},{"key":"e_1_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401966"},{"key":"e_1_2_1_138_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401966"},{"key":"e_1_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"e_1_2_1_140_1","unstructured":"Skoltech Computer Vision. Deep billion-scale indexing. http:\/\/sites.skoltech.ru\/compvision\/noimi 2018.  Skoltech Computer Vision. Deep billion-scale indexing. http:\/\/sites.skoltech.ru\/compvision\/noimi 2018."},{"key":"e_1_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1051\/0004-6361\/201322653"},{"key":"e_1_2_1_142_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"e_1_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556574"},{"key":"e_1_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"e_1_2_1_145_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995412.1995420"},{"key":"e_1_2_1_146_1","unstructured":"TEXMEX Research Team. Datasets for approximate nearest neighbor search. http:\/\/corpus-texmex.irisa.fr\/ 2018.  TEXMEX Research Team. Datasets for approximate nearest neighbor search. http:\/\/corpus-texmex.irisa.fr\/ 2018."},{"key":"e_1_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148176"},{"key":"e_1_2_1_148_1","unstructured":"S. University. Southwest University Adult Lifespan Dataset (SALD). http:\/\/fcon_1000.projects.nitrc.org\/indi\/retro\/sald.html?utm_source=newsletter&utm_medium=email&utm_content=See%20Data&utm_campaign=indi-1 2018.  S. University. Southwest University Adult Lifespan Dataset (SALD). http:\/\/fcon_1000.projects.nitrc.org\/indi\/retro\/sald.html?utm_source=newsletter&utm_medium=email&utm_content=See%20Data&utm_campaign=indi-1 2018."},{"key":"e_1_2_1_149_1","volume-title":"SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index. https:\/\/github.com\/DBWangGroupUNSW\/SRS","author":"D. W. G.","year":"2019"},{"key":"e_1_2_1_150_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.265"},{"key":"e_1_2_1_151_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0250-5"},{"key":"e_1_2_1_152_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536208"},{"key":"e_1_2_1_153_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.01.025"},{"key":"e_1_2_1_154_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671192"},{"key":"e_1_2_1_155_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2003)129:6(664)"},{"key":"e_1_2_1_156_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.424"},{"key":"e_1_2_1_157_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.151"},{"key":"e_1_2_1_158_1","volume-title":"Massively distributed time series indexing and querying. TKDE (to appear)","author":"Yagoubi D.-E.","year":"2019"},{"key":"e_1_2_1_159_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.226"},{"key":"e_1_2_1_160_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516439"},{"key":"e_1_2_1_161_1","first-page":"421","volume-title":"Proceedings of the 27th International Conference on Very Large Data Bases, VLDB '01","author":"Yu C.","year":"2001"},{"key":"e_1_2_1_162_1","first-page":"1202","volume-title":"TARDIS: Distributed Indexing Framework for Big Time Series Data. In 2019 IEEE 35th International Conference on Data Engineering (ICDE)","author":"Zhang L.","year":"2019"},{"key":"e_1_2_1_163_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0442-5"},{"key":"e_1_2_1_164_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0513-x"},{"key":"e_1_2_1_165_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783382"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3368289.3368303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:43:53Z","timestamp":1672220633000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3368289.3368303"}},"subtitle":["experimental evaluation of data series approximate similarity search"],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":165,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["10.14778\/3368289.3368303"],"URL":"https:\/\/doi.org\/10.14778\/3368289.3368303","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]}}}