{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:40:57Z","timestamp":1773895257076,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T00:00:00Z","timestamp":1494374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"International Research Centres in Singapore Funding Initiative"},{"name":"National University Student Innovation Program","award":["201410246020"],"award-info":[{"award-number":["201410246020"]}]},{"name":"Fudan's Undergraduate Research Opportunities Program","award":["14021"],"award-info":[{"award-number":["14021"]}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation, Prime Ministers Office, Singapore","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61073001"],"award-info":[{"award-number":["61073001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"crossref","award":["14ZR1403100"],"award-info":[{"award-number":["14ZR1403100"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2017,6,30]]},"abstract":"<jats:p>\n            More and more advanced technologies have become available to collect and integrate an unprecedented amount of data from multiple sources, including GPS trajectories about the traces of moving objects. Given the fact that GPS trajectories are vast in size while the information carried by the trajectories could be redundant, we focus on trajectory compression in this article. As a systematic solution, we propose a comprehensive framework, namely, COMPRESS (\n            <jats:italic>&lt;underline&gt;Com&lt;\/underline&gt;prehensive &lt;underline&gt;P&lt;\/underline&gt;aralleled &lt;underline&gt;R&lt;\/underline&gt;oad-Network-Based Trajectory Compr&lt;underline&gt;ess&lt;\/underline&gt;ion<\/jats:italic>\n            ), to compress GPS trajectory data in an urban road network. In the preprocessing step, COMPRESS decomposes trajectories into spatial paths and temporal sequences, with a thorough justification for trajectory decomposition. In the compression step, COMPRESS performs spatial compression on spatial paths, and temporal compression on temporal sequences in parallel. It introduces two alternative algorithms with different strengths for lossless spatial compression and designs lossy but error-bounded algorithms for temporal compression. It also presents query processing algorithms to support error-bounded location-based queries on compressed trajectories without full decompression. All algorithms under COMPRESS are efficient and have the time complexity of\n            <jats:italic>O<\/jats:italic>\n            (|\n            <jats:italic>T<\/jats:italic>\n            |), where |\n            <jats:italic>T<\/jats:italic>\n            | is the size of the input trajectory\n            <jats:italic>T<\/jats:italic>\n            . We have also conducted a comprehensive experimental study to demonstrate the effectiveness of COMPRESS, whose compression ratio is significantly better than related approaches.\n          <\/jats:p>","DOI":"10.1145\/3015457","type":"journal-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:08:53Z","timestamp":1494439733000},"page":"1-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["COMPRESS"],"prefix":"10.1145","volume":"42","author":[{"given":"Yunheng","family":"Han","sequence":"first","affiliation":[{"name":"Fudan University 8 Shanghai Key Laboratory of Data Science, Shanghai, China"}]},{"given":"Weiwei","family":"Sun","sequence":"additional","affiliation":[{"name":"Fudan University 8 Shanghai Key Laboratory of Data Science, Shanghai, China"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Singapore Management University, Stamford Road, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2017,5,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1165-y"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/0957-0233\/21\/3\/035103"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574703"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the VLDB Endowment. 853--864","author":"Brakatsoulas Sotiris","year":"2005"},{"key":"e_1_2_1_7_1","volume-title":"Wheeler","author":"Burrows Michael","year":"1994"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_12"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0163-7"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000077"},{"key":"e_1_2_1_11_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"2006"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/261226"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.10.009"},{"key":"e_1_2_1_16_1","first-page":"369","article-title":"Logarithmic-time link path queries in a simple polygon","volume":"5","author":"Mitchell Joseph S. B.","year":"1995","journal-title":"International Journal of Computational Geometry"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24983-9_7"},{"key":"e_1_2_1_18_1","volume-title":"ISA\u201991 Algorithms.","author":"Guibas Leonidas J."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1585\/pfr.9.3401083"},{"key":"e_1_2_1_20_1","unstructured":"Yunheng Han Weiwei Sun and Baihua Zheng. 2016. Sample data and the online appendix. Retrieved from https:\/\/github.com\/MasterChivu\/TODS-EXP.  Yunheng Han Weiwei Sun and Baihua Zheng. 2016. Sample data and the online appendix. Retrieved from https:\/\/github.com\/MasterChivu\/TODS-EXP."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-70467-2.50011-4"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2013.01.071"},{"key":"e_1_2_1_24_1","volume-title":"The Art of Computer Programming Volume 3: Sorting and Searching","author":"Knuth Donald E.","edition":"2"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653820"},{"key":"e_1_2_1_28_1","first-page":"1","article-title":"Minimum-link paths among obstacles in the plane","volume":"8","author":"Mitchell Joseph S. B.","year":"1992","journal-title":"Algorithmica"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMGEO.2013.5"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_2_1_31_1","unstructured":"OHPI. 2014. Highway Statistics Series. Retrieved from http:\/\/www.fhwa.dot.gov\/policyinformation\/statistics\/2011\/vm2.cfm.  OHPI. 2014. Highway Statistics Series. Retrieved from http:\/\/www.fhwa.dot.gov\/policyinformation\/statistics\/2011\/vm2.cfm."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0208-4"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0198"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2750858.2804286"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424428"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732940"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.88124"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237400"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"e_1_2_1_41_1","volume-title":"Bell","author":"Witten Ian H.","year":"2001"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806425"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3015457","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3015457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:40Z","timestamp":1750221520000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3015457"}},"subtitle":["A Comprehensive Framework of Trajectory Compression in Road Networks"],"short-title":[],"issued":{"date-parts":[[2017,5,10]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6,30]]}},"alternative-id":["10.1145\/3015457"],"URL":"https:\/\/doi.org\/10.1145\/3015457","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,10]]},"assertion":[{"value":"2015-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}