{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:42Z","timestamp":1740123522292,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:00:00Z","timestamp":1552608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2016R1A2B4015929"],"award-info":[{"award-number":["2016R1A2B4015929"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11227-019-02813-w","type":"journal-article","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T17:06:07Z","timestamp":1552669567000},"page":"6129-6157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indexable sub-trajectory matching using multi-segment approximation: a partition-and-stitch framework"],"prefix":"10.1007","volume":"75","author":[{"given":"Jae-Jun","family":"Yoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3161-6479","authenticated-orcid":false,"given":"Woong-Kee","family":"Loh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyu-Young","family":"Whang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,15]]},"reference":[{"key":"2813_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.future.2014.02.007","volume":"37","author":"S Alamri","year":"2014","unstructured":"Alamri S, Taniar D, Safar M (2014) A taxonomy for moving object queries in spatial databases. Future Gener Comput Syst 37:232\u2013242","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"2813_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TITS.2010.2048101","volume":"11","author":"S Atev","year":"2010","unstructured":"Atev S, Miller G, Papanikolopoulos NP (2010) Clustering of vehicle trajectories. IEEE Trans Intell Transp Syst 11(3):647\u2013657","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2813_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann N, Seeger B (2009) A revised R*-tree in comparison with related index structures. In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD), pp 799\u2013812","DOI":"10.1145\/1559845.1559929"},{"key":"2813_CR4","doi-asserted-by":"crossref","unstructured":"Buchin K, Buchin M, Kreveld MV, Luo J (2009) Finding long and similar parts of trajectories. In: Proceedings of ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS), pp 296\u2013305","DOI":"10.1145\/1653771.1653813"},{"issue":"4","key":"2813_CR5","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/S0031-3203(02)00128-0","volume":"36","author":"J Chen","year":"2003","unstructured":"Chen J, Leung MKH, Gao Y (2003) Noisy logo recognition using line segment Hausdorff distance. Pattern Recognit 36(4):943\u2013955","journal-title":"Pattern Recognit"},{"key":"2813_CR6","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/B978-012088469-8.50070-X","volume-title":"Proceedings 2004 VLDB Conference","author":"L CHEN","year":"2004","unstructured":"Chen L, Ng R (2004) On the marriage of Lp-norms and edit distance. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp 792\u2013803"},{"key":"2813_CR7","doi-asserted-by":"crossref","unstructured":"Chen L, Ozsu MT, Oria V (June 2005) Robust and fast similarity search for moving object trajectories. In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD), pp 491\u2013502","DOI":"10.1145\/1066157.1066213"},{"issue":"7","key":"2813_CR8","doi-asserted-by":"publisher","first-page":"787","DOI":"10.14778\/3192965.3192970","volume":"11","author":"X Ding","year":"2018","unstructured":"Ding X, Chen L, Gao Y, Jensen CS, Bao H (2018) UlTraMan: a unified platform for big trajectory data management and analytics. Proc VLDB Endow 11(7):787\u2013799","journal-title":"Proc VLDB Endow"},{"key":"2813_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.knosys.2018.01.007","volume":"148","author":"Y Dong","year":"2018","unstructured":"Dong Y, Pi D (2018) Novel privacy-preserving algorithm based on frequent path for trajectory data publishing. Knowl Based Syst 148:55\u201365","journal-title":"Knowl Based Syst"},{"key":"2813_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/b18212","volume-title":"3D game engine design: a practical approach to real-time computer graphics","author":"DH Eberly","year":"2006","unstructured":"Eberly DH (2006) 3D game engine design: a practical approach to real-time computer graphics, 2nd edn. Morgan Kaufmann, Burlington","edition":"2"},{"key":"2813_CR11","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 226\u2013231"},{"key":"2813_CR12","doi-asserted-by":"crossref","unstructured":"Frentzos E, Gratsias K, Theodoridis Y (2007) Index-based most similar trajectory search. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 816\u2013825","DOI":"10.1109\/ICDE.2007.367927"},{"issue":"2","key":"2813_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00778-011-0262-6","volume":"24","author":"C-C Hung","year":"2015","unstructured":"Hung C-C, Peng W-C, Lee W-C (2015) Clustering and aggregating clues of trajectories for mining trajectory patterns and routes. VLDB J 24(2):169\u2013192","journal-title":"VLDB J"},{"key":"2813_CR14","unstructured":"Huttenlocher DP, Kedem K (1990) Computing the minimum Hausdorff distance for point sets under translation. In: Proceedings of ACM annual symposium on computational geometry (SCG), pp 340\u2013349"},{"key":"2813_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.datak.2017.10.001","volume":"113","author":"E Kaplan","year":"2018","unstructured":"Kaplan E, G\u00fcrsoy ME, Nergiz ME, Saygin Y (2018) Location disclosure risks of releasing trajectory distances. Data Knowl Eng 113:43\u201363","journal-title":"Data Knowl Eng"},{"key":"2813_CR16","unstructured":"Lee J-G, Han J, Whang K-Y (2007) Trajectory clustering: a partition-and-group framework. In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD), pp 593\u2013604"},{"key":"2813_CR17","unstructured":"Lee J-G, Han J, Li X (2008) Trajectory outlier detection: a partition-and-detect framework. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 140\u2013149"},{"issue":"1","key":"2813_CR18","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.14778\/1453856.1453972","volume":"1","author":"J-G Lee","year":"2008","unstructured":"Lee J-G, Han J, Li X, Gonzalez H (2008) TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. Proc VLDB Endow (PVLDB) 1(1):1081\u20131094","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"2813_CR19","doi-asserted-by":"crossref","unstructured":"Mao J, Sun P, Jin C, Zhou A (2018) Outlier detection over distributed trajectory streams. In: Proceedings of SIAM International Conference on Data Mining (SDM), San Diego, pp 64\u201372","DOI":"10.1137\/1.9781611975321.8"},{"issue":"3","key":"2813_CR20","doi-asserted-by":"publisher","first-page":"524","DOI":"10.3390\/s17030524","volume":"17","author":"Y Mao","year":"2017","unstructured":"Mao Y, Zhong H, Xiao X, Li X (2017) A segment-based trajectory similarity measure in the urban transportation systems. Sensors 17(3):524","journal-title":"Sensors"},{"issue":"8","key":"2813_CR21","doi-asserted-by":"publisher","first-page":"506","DOI":"10.14778\/2002974.2002978","volume":"4","author":"S Nutanong","year":"2011","unstructured":"Nutanong S, Jacox EH, Samet H (2011) An incremental Hausdorff distance calculation algorithm. Proc VLDB Endow (PVLDB) 4(8):506\u2013517","journal-title":"Proc VLDB Endow (PVLDB)"},{"issue":"5","key":"2813_CR22","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1007\/s10618-017-0503-4","volume":"31","author":"N Pelekis","year":"2017","unstructured":"Pelekis N, Tampakis P, Vodas M, Doulkeridis C, Theodoridis Y (2017) On temporal-constrained sub-trajectory cluster analysis. Data Min Knowl Discov (DMKD) 31(5):1294\u20131330","journal-title":"Data Min Knowl Discov (DMKD)"},{"key":"2813_CR23","doi-asserted-by":"crossref","unstructured":"Ranu S, Deepak P, Telang AD, Deshpande P, Raghavan S (2015) Indexing and matching trajectories under inconsistent sampling rates. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 999\u20131010","DOI":"10.1109\/ICDE.2015.7113351"},{"key":"2813_CR24","doi-asserted-by":"crossref","unstructured":"Shang Z, Li G, Bao Z (2018) DITA: distributed in-memory trajectory analytics. In: Proceedings of International Conference on Management of Data (SIGMOD), Houston, pp 725\u2013740","DOI":"10.1145\/3183713.3183743"},{"key":"2813_CR25","doi-asserted-by":"crossref","unstructured":"Vlachos M, Kollios G, Gunopulos D (2002) Discovering similar multidimensional trajectories. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 673\u2013684","DOI":"10.1109\/ICDE.2002.994784"},{"key":"2813_CR26","doi-asserted-by":"crossref","unstructured":"Wolfson O, Xu B, Chamberlain S, Jiang L (1998) Moving objects databases: issues and solutions. In: Proceedings of IEEE International Conference on Scientific and Statistical Database Management, pp 111\u2013122","DOI":"10.1109\/SSDM.1998.688116"},{"key":"2813_CR27","doi-asserted-by":"crossref","unstructured":"Xie M (2014) EDS: a segment-based distance measure for sub-trajectory similarity search. In: Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD), pp 1609\u20131610","DOI":"10.1145\/2588555.2612665"},{"issue":"11","key":"2813_CR28","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.14778\/3137628.3137655","volume":"10","author":"D Xie","year":"2017","unstructured":"Xie D, Li F, Phillips JM (2017) Distributed trajectory similarity search. Proc VLDB Endow (PVLDB) 10(11):1478\u20131489","journal-title":"Proc VLDB Endow (PVLDB)"},{"key":"2813_CR29","unstructured":"Yi B-K, Jagadish HV, Faloutsos C (1998) Efficient retrieval of similar time sequences under time warping. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp 201\u2013208"},{"issue":"1","key":"2813_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10462-016-9477-7","volume":"47","author":"G Yuan","year":"2017","unstructured":"Yuan G, Sun P, Zhao J, Li D, Wang C (2017) A review of moving object trajectory clustering algorithms. Artif Intell Rev 47(1):123\u2013144","journal-title":"Artif Intell Rev"},{"key":"2813_CR31","doi-asserted-by":"crossref","unstructured":"Zheng Y, Zhang L, Xie X, Ma W-Y (2009) Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of International Conference on World Wide Web (WWW), pp 791\u2013800","DOI":"10.1145\/1526709.1526816"},{"volume-title":"Computing with spatial trajectories","year":"2011","key":"2813_CR32","unstructured":"Zheng Y, Zhou X (eds) (2011) Computing with spatial trajectories. Springer, Berlin"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02813-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02813-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02813-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T23:58:44Z","timestamp":1606780724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02813-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,15]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2813"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02813-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,3,15]]},"assertion":[{"value":"15 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}