{"id":"https://openalex.org/W1978336813","doi":"https://doi.org/10.1109/35021bigcomp.2015.7072822","title":"Fast index construction for distortion-free subsequence matching in time-series databases","display_name":"Fast index construction for distortion-free subsequence matching in time-series databases","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W1978336813","doi":"https://doi.org/10.1109/35021bigcomp.2015.7072822","mag":"1978336813"},"language":"en","primary_location":{"id":"doi:10.1109/35021bigcomp.2015.7072822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/35021bigcomp.2015.7072822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Big Data and Smart Computing (BIGCOMP)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082412172","display_name":"Myeong\u2010Seon Gil","orcid":"https://orcid.org/0000-0003-4611-644X"},"institutions":[{"id":"https://openalex.org/I165507594","display_name":"Kangwon National University","ror":"https://ror.org/01mh5ph17","country_code":"KR","type":"education","lineage":["https://openalex.org/I165507594"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Myeong-Seon Gil","raw_affiliation_strings":["Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea","institution_ids":["https://openalex.org/I165507594"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100719095","display_name":"Bum\u2010Soo Kim","orcid":"https://orcid.org/0000-0002-3870-6813"},"institutions":[{"id":"https://openalex.org/I165507594","display_name":"Kangwon National University","ror":"https://ror.org/01mh5ph17","country_code":"KR","type":"education","lineage":["https://openalex.org/I165507594"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Bum-Soo Kim","raw_affiliation_strings":["Instute of Telecommunication and Information, Kangwon National University, Chuncheon, Gangwon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instute of Telecommunication and Information, Kangwon National University, Chuncheon, Gangwon, Korea","institution_ids":["https://openalex.org/I165507594"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056904727","display_name":"Mi-Jung Choi","orcid":"https://orcid.org/0000-0002-9062-4604"},"institutions":[{"id":"https://openalex.org/I165507594","display_name":"Kangwon National University","ror":"https://ror.org/01mh5ph17","country_code":"KR","type":"education","lineage":["https://openalex.org/I165507594"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Mi-Jung Choi","raw_affiliation_strings":["Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea","institution_ids":["https://openalex.org/I165507594"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101402186","display_name":"Yang\u2010Sae Moon","orcid":"https://orcid.org/0000-0002-2396-0405"},"institutions":[{"id":"https://openalex.org/I165507594","display_name":"Kangwon National University","ror":"https://ror.org/01mh5ph17","country_code":"KR","type":"education","lineage":["https://openalex.org/I165507594"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yang-Sae Moon","raw_affiliation_strings":["Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Kangwon National University, Chuncheon, Gangwon, Korea","institution_ids":["https://openalex.org/I165507594"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165507594"],"apc_list":null,"apc_paid":null,"fwci":0.7284,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.66166297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"130","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9695000052452087,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.9000442028045654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.761972188949585},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7103464007377625},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.6439003944396973},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6317591667175293},{"id":"https://openalex.org/keywords/distortion","display_name":"Distortion (music)","score":0.609965980052948},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.6062291860580444},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.5666514039039612},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5500860214233398},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5007083415985107},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.49113938212394714},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4760401248931885},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47044581174850464},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36473801732063293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17858386039733887},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07358875870704651}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.9000442028045654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.761972188949585},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7103464007377625},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.6439003944396973},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6317591667175293},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.609965980052948},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.6062291860580444},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5666514039039612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5500860214233398},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5007083415985107},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.49113938212394714},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4760401248931885},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47044581174850464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36473801732063293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17858386039733887},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07358875870704651},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C194257627","wikidata":"https://www.wikidata.org/wiki/Q211554","display_name":"Amplifier","level":3,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/35021bigcomp.2015.7072822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/35021bigcomp.2015.7072822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Big Data and Smart Computing (BIGCOMP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W83673003","https://openalex.org/W139541242","https://openalex.org/W1482428201","https://openalex.org/W1499049447","https://openalex.org/W1544274373","https://openalex.org/W1967176902","https://openalex.org/W1972677429","https://openalex.org/W1974583161","https://openalex.org/W2010142086","https://openalex.org/W2014626504","https://openalex.org/W2016876497","https://openalex.org/W2035333697","https://openalex.org/W2047954180","https://openalex.org/W2048897436","https://openalex.org/W2050034813","https://openalex.org/W2066796814","https://openalex.org/W2074894386","https://openalex.org/W2095380702","https://openalex.org/W2107856142","https://openalex.org/W2109355547","https://openalex.org/W2128061541","https://openalex.org/W2151135734","https://openalex.org/W2152074578","https://openalex.org/W2155912412","https://openalex.org/W2158597732","https://openalex.org/W2997027240","https://openalex.org/W6683092170"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W170643605","https://openalex.org/W1999879627","https://openalex.org/W4295189757","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W2170721049"],"abstract_inverted_index":{"In":[0,20,122],"this":[1,74,90],"paper":[2],"we":[3,9,92,124,183],"address":[4],"a":[5,12,30,37,67,70,117,132,157,178],"problem":[6],"of":[7,40,106,115,129,173,180,201],"how":[8],"can":[10],"construct":[11,156],"multidimensional":[13,118,158],"index":[14,27,60,78,97,119,159,186],"efficiently":[15],"in":[16,145],"distortion-free":[17,23],"subsequence":[18,24],"matching.":[19],"the":[21,26,59,77,96,104,126,138,146,150,153,163,171,174,185],"previous":[22,164],"matching,":[25],"construction":[28,61,79,98,187],"is":[29,81,196],"very":[31,82,120],"time-consuming":[32],"process":[33],"since":[34],"it":[35],"generates":[36],"huge":[38],"number":[39],"data":[41],"subsequences":[42],"to":[43,102,192],"consider":[44],"all":[45,49],"possible":[46,50],"positions":[47],"and":[48,73,109,141,167],"query":[51],"lengths.":[52],"The":[53],"real":[54],"experimental":[55],"results":[56,140],"show":[57],"that,":[58],"time":[62,188],"reaches":[63],"several":[64],"hours":[65],"for":[66,84],"time-series":[68,86,179],"with":[69],"million":[71],"entries,":[72],"means":[75],"that":[76],"itself":[80],"difficult":[83],"large":[85],"databases.":[87],"To":[88],"solve":[89],"problem,":[91],"first":[93],"formally":[94],"analyze":[95],"steps,":[99],"then":[100],"try":[101],"optimize":[103],"performance":[105],"each":[107],"step,":[108],"finally":[110],"propose":[111],"two":[112,199],"advanced":[113],"algorithms":[114,155],"constructing":[116],"fast.":[121],"particular,":[123],"present":[125],"novel":[127],"concept":[128],"store-and-reuse":[130,151],"principle,":[131,152],"dynamic":[133],"programming":[134],"technique,":[135],"which":[136,195],"stores":[137],"intermediate":[139],"reuses":[142],"them":[143],"repeatedly":[144],"next":[147],"steps.":[148],"Through":[149],"proposed":[154,175],"much":[160],"faster":[161],"than":[162],"algorithm.":[165],"Analytical":[166],"empirical":[168],"evaluations":[169],"showcase":[170],"superiority":[172],"algorithms.":[176],"For":[177],"length":[181],"300,000,":[182],"reduce":[184],"from":[189],"100":[190],"minutes":[191],"7.5":[193],"minutes,":[194],"one":[197],"or":[198],"orders":[200],"magnitude.":[202]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}