{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:15:41Z","timestamp":1755839741867,"version":"3.28.0"},"reference-count":67,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1109\/icde60146.2024.00301","type":"proceedings-article","created":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T17:38:03Z","timestamp":1721756283000},"page":"3933-3946","source":"Crossref","is-referenced-by-count":1,"title":["CLIMBER: Pivot-Based Approximate Similarity Search Over Big Data Series"],"prefix":"10.1109","author":[{"given":"Liang","family":"Zhang","sequence":"first","affiliation":[{"name":"Oracle, Oracle Inc.,Austin,TX,USA"}]},{"given":"Mohamed Y.","family":"Eltabakh","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute (QCRI), HBKU,Doha,Qatar"}]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute (WPI),Computer Science Department,Worcester,MA,USA"}]},{"given":"Khalid","family":"Alnuaim","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute (WPI),Computer Science Department,Worcester,MA,USA"}]}],"member":"263","reference":[{"volume-title":"CLIMBER Source Code","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0596-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1268821"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.04.007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00052"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICEMIS.2016.7745355"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328920"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98741"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.153.3731.34"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.124"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811395"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/icde.1999.754915"},{"key":"ref15","volume-title":"Time series: applications to finance","volume":"487","author":"Chan","year":"2004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3579075.3579087"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11579427_41"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2958185"},{"journal-title":"Postgresql: The worlds most advanced open source relational database","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.04.030"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454226"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368303"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2379776.2379788"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.11.011"},{"volume-title":"Fast subsequence match in time-series databases","year":"1994","author":"Faloutsos","key":"ref25"},{"volume-title":"Ai2 dolma: 3 trillion token open corpus for language model pretraining","key":"ref26"},{"volume-title":"Pynndescent for fast approximate nearest neighbors","key":"ref27"},{"volume-title":"Redpajama-data-v2: an open dataset with 30 trillion tokens for training large language models","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70815"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2740932"},{"key":"ref33","article-title":"Billion-scale similarity search with gpus","volume":"abs\/1702.08734","author":"Johnson","year":"2017","journal-title":"CoRR"},{"volume-title":"Hilbert r-tree: An improved r-tree using fractals","year":"1993","author":"Kamel","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011669"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772749"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/9781108684163"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0064-z"},{"key":"ref40","first-page":"38","article-title":"SSH (sketch, shingle, & hash) for indexing massive-scale time series","volume-title":"Proceedings of the NIPS 2016 Time Series Workshop, volume 55 of JMLR Workshop and Conference Proceedings","author":"Luo","year":"2016"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638475"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314031"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.10.002"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49214-7_2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49192-8_6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/HPCS.2017.155"},{"key":"ref48","article-title":"Evolution of a data series index","volume-title":"ISIP","author":"Palpanas","year":"2019"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850589"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00036"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00677-2"},{"volume-title":"Foundations of multidimensional and metric data structures","year":"2006","author":"Samet","key":"ref52"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(83)90007-5"},{"key":"ref54","first-page":"623","article-title":"isax: indexing and mining terabyte sized time series","volume-title":"SIGKDD","author":"Shieh","year":"2008"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.09.011"},{"journal-title":"DiskANN: fast accurate billion-point nearest neighbor search on a single node","year":"2019","author":"Subramanya","key":"ref57"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1995412.1995420"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1199"},{"volume-title":"Vector DBs. Chroma: the ai-native open-source embedding database","key":"ref61"},{"key":"ref62","article-title":"Time series analysis","volume":"2","author":"Wei","year":"2006","journal-title":"The Oxford Handbook of Quantitative Methods in Psychology"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00082"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.151"},{"key":"ref65","article-title":"Spark: Cluster computing with working sets","author":"Zaharia","year":"2010","journal-title":"HotCloud"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00110"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384705"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377374"}],"event":{"name":"2024 IEEE 40th International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2024,5,13]]},"location":"Utrecht, Netherlands","end":{"date-parts":[[2024,5,16]]}},"container-title":["2024 IEEE 40th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10597630\/10597390\/10597995.pdf?arnumber=10597995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T05:39:44Z","timestamp":1721799584000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10597995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":67,"URL":"https:\/\/doi.org\/10.1109\/icde60146.2024.00301","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]}}}