{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:00:06Z","timestamp":1774591206147,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030235833","type":"print"},{"value":"9783030235840","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23584-0_9","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T06:03:41Z","timestamp":1562133821000},"page":"149-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scalable Algorithm for Subsequence Similarity Search in Very Large Time Series Data on Cluster of Phi KNL"],"prefix":"10.1007","author":[{"given":"Yana","family":"Kraeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7491-8656","authenticated-orcid":false,"given":"Mikhail","family":"Zymbler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,4]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.3103\/S1068373912010025","volume":"37","author":"SM Abdullaev","year":"2012","unstructured":"Abdullaev, S.M., Zhelnin, A.A., Lenskaya, O.Y.: The structure of mesoscale convective systems in central Russia. Russ. Meteorol. Hydrol. 37(1), 12\u201320 (2012)","journal-title":"Russ. Meteorol. Hydrol."},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/197405.197406","volume":"26","author":"DF Bacon","year":"1994","unstructured":"Bacon, D.F., Graham, S.L., Sharp, O.J.: Compiler transformations for high-performance computing. ACM Comput. Surv. 26(4), 345\u2013420 (1994). \n                    https:\/\/doi.org\/10.1145\/197405.197406","journal-title":"ACM Comput. Surv."},{"key":"9_CR3","unstructured":"Berndt, D.J., Clifford, J.: Using dynamic time warping to find patterns in time series. In: Proceedings of the 1994 AAAI Workshop on Knowledge Discovery in Databases, Seattle, Washington, July 1994, pp. 359\u2013370. AAAI Press (1994)"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Chrysos, G.: Intel Xeon Phi coprocessor (codename Knights Corner). In: 2012 IEEE Hot Chips 24th Symposium (HCS), Cupertino, CA, USA, 27\u201329 August 2012, pp. 1\u201331. IEEE (2012). \n                    https:\/\/doi.org\/10.1109\/hotchips.2012.7476487","DOI":"10.1109\/hotchips.2012.7476487"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.14778\/1454159.1454226","volume":"1","author":"H Ding","year":"2008","unstructured":"Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., Keogh, E.: Querying and mining of time series data: experimental comparison of representations and distance measures. Proc. VLDB Endow. 1(2), 1542\u20131552 (2008). \n                    https:\/\/doi.org\/10.14778\/1454159.1454226","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"9_CR6","first-page":"44","volume":"2","author":"V Epishev","year":"2013","unstructured":"Epishev, V., Isaev, A., Miniakhmetov, R., et al.: Physiological data mining system for elite sports. Bull. South Ural State Univ. Ser. Comput. Math. Softw. Eng. 2(1), 44\u201354 (2013)","journal-title":"Bull. South Ural State Univ. Ser. Comput. Math. Softw. Eng."},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Goldberger, A.L., Amaral, L.A.N., Glass, L., Hausdorff, J.M., Ivanov, Pl.Ch., et al.: PhysioBank, PhysioToolkit, and PhysioNet. Circulation 101(23), e215\u2013e220 (2000). \n                    https:\/\/doi.org\/10.1161\/01.cir.101.23.e215","DOI":"10.1161\/01.cir.101.23.e215"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10115-004-0154-9","volume":"7","author":"EJ Keogh","year":"2005","unstructured":"Keogh, E.J., Ratanamahatana, C.A.: Exact indexing of dynamic time warping. Knowl. Inf. Syst. 7(3), 358\u2013386 (2005). \n                    https:\/\/doi.org\/10.1007\/s10115-004-0154-9","journal-title":"Knowl. Inf. Syst."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Kostenetskiy, P., Semenikhina, P.: SUSU supercomputer resources for industry and fundamental science. In: GloSIC 2018, Proceedings of the Global Smart Industry Conference, Chelyabinsk, Russia, 13\u201315 November 2018, Article no. 8570068 (2018). \n                    https:\/\/doi.org\/10.1109\/glosic.2018.8570155","DOI":"10.1109\/glosic.2018.8570155"},{"key":"9_CR10","unstructured":"Kraeva, Ya., Zymbler, M.: An efficient subsequence similarity search on modern Intel many-core processors for data intensive applications. In: Proceedings of the 20th International Conference on Data Analytics and Management in Data Intensive Domains (DAMDID\/RCDL 2018). CEUR Workshop Proceedings, Moscow, Russia, 9\u201312 October 2018, vol. 2277, pp. 143\u2013151. CEUR-WS.org (2018)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.procs.2015.11.009]","volume":"66","author":"AV Movchan","year":"2015","unstructured":"Movchan, A.V., Zymbler, M.L.: Parallel algorithm for local-best-match time series subsequence similarity search on the Intel MIC architecture. Procedia Comput. Sci. 66, 63\u201372 (2015). \n                    https:\/\/doi.org\/10.1016\/j.procs.2015.11.009%5d","journal-title":"Procedia Comput. Sci."},{"key":"9_CR12","unstructured":"Movchan, A.V., Zymbler, M.L.: Parallel implementation of searching the most similar subsequence in time series for computer systems with distributed memory. In: Sokolinsky, L., Starodubov, I. (eds.) PCT 2016, International Scientific Conference on Parallel Computational Technologies. CEUR Workshop Proceedings, Arkhangelsk, Russia, 29\u201331 March 2016, vol. 1576, pp. 615\u2013628. CEUR-WS.org (2016)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-25087-8_28","volume-title":"Similarity Search and Applications","author":"A Movchan","year":"2015","unstructured":"Movchan, A., Zymbler, M.: Time series subsequence similarity search under dynamic time warping distance on the intel many-core accelerators. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds.) SISAP 2015. LNCS, vol. 9371, pp. 295\u2013306. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-25087-8_28"},{"issue":"1865","key":"9_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1038\/072342a0","volume":"72","author":"K Pearson","year":"1905","unstructured":"Pearson, K.: The problem of the random walk. Nature 72(1865), 294 (1905). \n                    https:\/\/doi.org\/10.1038\/072342a0","journal-title":"Nature"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Rakthanmanon, T., Campana, B.J.L., Mueen, A., Batista, G.E.A.P.A., Westover, M.B., et al.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China, 12\u201316 August 2012, pp. 262\u2013270. ACM, New York (2012). \n                    https:\/\/doi.org\/10.1145\/2339530.2339576","DOI":"10.1145\/2339530.2339576"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/B978-0-08-051584-7.50016-4","volume-title":"Readings in Speech Recognition","author":"H Sakoe","year":"1990","unstructured":"Sakoe, H., Chiba, S.: Dynamic Programming algorithm optimization for spoken word recognition. In: Waibel, A., Lee, K.-F. (eds.) Readings in Speech Recognition, pp. 159\u2013165. Morgan Kaufmann Publishers Inc., San Francisco (1990)"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Sart, D., Mueen, A., Najjar, W.A., Keogh, E.J., Niennattrakul, V.: Accelerating dynamic time warping subsequence search with GPUs and FPGAs. In: Proceedings of the 2010 IEEE International Conference on Data Mining, Sydney, Australia, 14\u201317 December 2010, pp. 1001\u20131006. IEEE Computer Society, Washington, DC (2010). \n                    https:\/\/doi.org\/10.1109\/icdm.2010.21","DOI":"10.1109\/icdm.2010.21"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Shabib, A., Narang, A., Niddodi, C.P., et al.: Parallelization of searching and mining time series data using dynamic time warping. In: Proceedings of the 2015 International Conference on Advances in Computing, Communications and Informatics, Kochi, India, 10\u201313 August, 2015, pp. 343\u2013348. IEEE (2015). \n                    https:\/\/doi.org\/10.1109\/icacci.2015.7275633","DOI":"10.1109\/icacci.2015.7275633"},{"key":"9_CR19","unstructured":"Siberian Supercomputing Centre of ICMMG SB RAS. \n                    http:\/\/www.sscc.icmmg.nsc.ru\/hardware.html"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Sodani, A.: Knights Landing (KNL): 2nd generation Intel Xeon Phi processor. In: 2015 IEEE Hot Chips 27th Symposium (HCS), Cupertino, CA, USA, 22\u201325 August 2015, pp. 1\u201324. IEEE (2015)","DOI":"10.1109\/HOTCHIPS.2015.7477467"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-55669-7_17","volume":"687","author":"I Sokolinskaya","year":"2016","unstructured":"Sokolinskaya, I., Sokolinsky, L.: Revised pursuit algorithm for solving non-stationary linear programming problems on modern computing clusters with manycore accelerators. Commun. Comput. Inf. Sci. 687, 212\u2013223 (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-55669-7_17","journal-title":"Commun. Comput. Inf. Sci."},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Srikanthan, S., Kumar, A., Gupta, R.: Implementing the dynamic time warping algorithm in multithreaded environments for real time and unsupervised pattern discovery. In: 2011 2nd International Conference on Computer and Communication Technology, Allahabad, India, 15\u201317 September 2011, pp. 394\u2013398. IEEE (2015). \n                    https:\/\/doi.org\/10.1109\/iccct.2011.6075111","DOI":"10.1109\/iccct.2011.6075111"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Takahashi, N., Yoshihisa, T., Sakurai, Y., Kanazawa, M.: A parallelized data stream processing system using dynamic time warping distance. In: 2009 International Conference on Complex, Intelligent and Software Intensive Systems, Fukuoka, Japan, 16\u201319 March 2009, pp. 1100\u20131105. IEEE (2009). \n                    https:\/\/doi.org\/10.1109\/cisis.2009.77","DOI":"10.1109\/cisis.2009.77"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Tarango, J., Keogh, E.J., Brisk, P.: Instruction set extensions for dynamic time warping. In: Proceedings of the International Conference on Hardware\/Software Codesign and System Synthesis, Montreal, QC, Canada, 29 September\u20134 October 2013, pp. 18:1\u201318:10. IEEE (2013). \n                    https:\/\/doi.org\/10.1109\/codes-isss.2013.6659005","DOI":"10.1109\/codes-isss.2013.6659005"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Wang, Z., Huang, S., Wang, L., Li, H., Wang, Y., et al.: Accelerating subsequence similarity search based on dynamic time warping distance with FPGA. In: Proceedings of the ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, Monterey, CA, USA, 11\u201313 February 2013, pp. 53\u201362. ACM, New York (2013). \n                    https:\/\/doi.org\/10.1145\/2435264.2435277","DOI":"10.1145\/2435264.2435277"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Adl, K., Glass, J.R.: Fast spoken query detection using lower-bound dynamic time warping on graphical processing units. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing, Kyoto, Japan, 25\u201330 March 2012, pp. 5173\u20135176. IEEE (2012). \n                    https:\/\/doi.org\/10.1109\/icassp.2012.6289085","DOI":"10.1109\/icassp.2012.6289085"}],"container-title":["Communications in Computer and Information Science","Data Analytics and Management in Data Intensive Domains"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23584-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T06:05:44Z","timestamp":1562133944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23584-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030235833","9783030235840"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23584-0_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAMDID\/RCDL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Analytics and Management in Data Intensive Domains","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"damdid2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/damdid2018.frccsc.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}