{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:40:58Z","timestamp":1773895258958,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:p>Massive volumes of uncertain trajectory data are being generated by GPS devices. Due to the limitations of GPS data, these trajectories are generally uncertain. This state of affairs renders it is attractive to be able to compress uncertain trajectories and to be able to query the trajectories efficiently without the need for (full) decompression. Unlike existing studies that target accurate trajectories, we propose a framework that accommodates uncertain trajectories in road networks. To address the large cardinality of instances of a single uncertain trajectory, we exploit the similarity between uncertain trajectory instances and provide a referential representation. First, we propose a reference selection algorithm based on the notion of Fine-grained Jaccard Distance to efficiently select trajectory instances as references. Then we provide referential representations of the different types of information contained in trajectories to achieve high compression ratios. In particular, a new compression scheme for temporal information is presented to take into account variations in sample intervals. Finally, we propose an index and develop filtering techniques to support efficient queries over compressed uncertain trajectories. Extensive experiments with real-life datasets offer insight into the properties of the framework and suggest that it is capable of outperforming the existing state-of-the-art method in terms of both compression ratio and efficiency.<\/jats:p>","DOI":"10.14778\/3384345.3384353","type":"journal-article","created":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T14:21:06Z","timestamp":1585232466000},"page":"1050-1063","source":"Crossref","is-referenced-by-count":67,"title":["Compression of uncertain trajectories in road networks"],"prefix":"10.14778","volume":"13","author":[{"given":"Tianyi","family":"Li","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}]},{"given":"Ruikai","family":"Huang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}]},{"given":"Torben Bach","family":"Pedersen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2020,3,26]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"RAND CORP SANTA MONICA CALIF","author":"Bellman R.","year":"1962","unstructured":"R. Bellman and B. Kotkin . On the approximation of curves by line segments using dynamic programming. ii. Technical report , RAND CORP SANTA MONICA CALIF , 1962 . R. Bellman and B. Kotkin. On the approximation of curves by line segments using dynamic programming. ii. Technical report, RAND CORP SANTA MONICA CALIF, 1962."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2012.08.001"},{"issue":"5","key":"e_1_2_1_3_1","first-page":"1508","article-title":"Vector-based trajectory storage and query for intelligent transport system","volume":"19","author":"Cai Z.","year":"2017","unstructured":"Z. Cai , F. Ren , J. Chen , and Z. Ding . Vector-based trajectory storage and query for intelligent transport system . TITS , 19 ( 5 ): 1508 -- 1519 , 2017 . Z. Cai, F. Ren, J. Chen, and Z. Ding. Vector-based trajectory storage and query for intelligent transport system. TITS, 19(5):1508--1519, 2017.","journal-title":"TITS"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.01.003"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2910591"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/s18061925"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113317"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2186146"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447829"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr505"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.03.006"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.02.010"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3015457"},{"issue":"1","key":"e_1_2_1_14_1","first-page":"114","article-title":"If-matching: Towards accurate map-matching with information fusion","volume":"29","author":"Hu G.","year":"2016","unstructured":"G. Hu , J. Shao , F. Liu , Y. Wang , and H. Shen . If-matching: Towards accurate map-matching with information fusion . TKDE , 29 ( 1 ): 114 -- 127 , 2016 . G. Hu, J. Shao, F. Liu, Y. Wang, and H. Shen. If-matching: Towards accurate map-matching with information fusion. TKDE, 29(1):114--127, 2016.","journal-title":"TKDE"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2015.137"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840638"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00102"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996972"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.09.005"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2862436"},{"key":"e_1_2_1_22_1","volume-title":"One-pass trajectory simplification using the synchronous Euclidean distance. arXiv preprint arXiv:1801.05360","author":"Lin X.","year":"2018","unstructured":"X. Lin , J. Jiang , S. Ma , Y. Zuo , and C. Hu . One-pass trajectory simplification using the synchronous Euclidean distance. arXiv preprint arXiv:1801.05360 , 2018 . X. Lin, J. Jiang, S. Ma, Y. Zuo, and C. Hu. One-pass trajectory simplification using the synchronous Euclidean distance. arXiv preprint arXiv:1801.05360, 2018."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113350"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598171"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735466"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653820"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-013-0184-0"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-018-7254-0"},{"key":"e_1_2_1_29_1","first-page":"275","volume-title":"SSDBM","author":"Potamias M.","year":"2006","unstructured":"M. Potamias , K. Patroumpas , and T. Sellis . Sampling trajectory streams with spatiotemporal criteria . In SSDBM , pages 275 -- 284 , 2006 . M. Potamias, K. Patroumpas, and T. Sellis. Sampling trajectory streams with spatiotemporal criteria. In SSDBM, pages 275--284, 2006."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732940"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-018-9435-5"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90024-8"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989419"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-7-30"},{"issue":"5","key":"e_1_2_1_35_1","first-page":"1275","article-title":"Fresco: Referential compression of highly similar sequences","volume":"10","author":"Wandelt S.","year":"2013","unstructured":"S. Wandelt and U. Leser . Fresco: Referential compression of highly similar sequences . TCBB , 10 ( 5 ): 1275 -- 1288 , 2013 . S. Wandelt and U. Leser. Fresco: Referential compression of highly similar sequences. TCBB, 10(5):1275--1288, 2013.","journal-title":"TCBB"},{"issue":"2","key":"e_1_2_1_36_1","first-page":"844","article-title":"Efficient compression of 4D-trajectory data in air traffic management","volume":"16","author":"Wandelt S.","year":"2014","unstructured":"S. Wandelt and X. Sun . Efficient compression of 4D-trajectory data in air traffic management . TITS , 16 ( 2 ): 844 -- 853 , 2014 . S. Wandelt and X. Sun. Efficient compression of 4D-trajectory data in air traffic management. TITS, 16(2):844--853, 2014.","journal-title":"TITS"},{"key":"e_1_2_1_37_1","volume-title":"Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. PVLDB, 3(1--2):1219--1230","author":"Wang J.","year":"2010","unstructured":"J. Wang , J. Feng , and G. Li . Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. PVLDB, 3(1--2):1219--1230 , 2010 . J. Wang, J. Feng, and G. Li. Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. PVLDB, 3(1--2):1219--1230, 2010."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339562"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"},{"issue":"4","key":"e_1_2_1_40_1","first-page":"613","article-title":"A novel representation and compression for queries on trajectories in road networks","volume":"30","author":"Yang X.","year":"2017","unstructured":"X. Yang , B. Wang , K. Yang , C. Liu , and B. Zheng . A novel representation and compression for queries on trajectories in road networks . TKDE , 30 ( 4 ): 613 -- 629 , 2017 . X. Yang, B. Wang, K. Yang, C. Liu, and B. Zheng. A novel representation and compression for queries on trajectories in road networks. TKDE, 30(4):613--629, 2017.","journal-title":"TKDE"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213885"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2714199"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220030"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743025"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3384345.3384353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:53:23Z","timestamp":1672221203000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3384345.3384353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":45,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["10.14778\/3384345.3384353"],"URL":"https:\/\/doi.org\/10.14778\/3384345.3384353","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}