{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:41:05Z","timestamp":1773895265767,"version":"3.50.1"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,5]]},"abstract":"<jats:p>\n            Location data becomes more and more important. In this paper, we focus on the trajectory data, and propose a new framework, namely PRESS (\n            <jats:italic>&lt;u&gt;P&lt;\/u&gt;aralleled &lt;u&gt;R&lt;\/u&gt;oad-Network-Based Trajectory Compr&lt;u&gt;ess&lt;\/u&gt;ion<\/jats:italic>\n            ), to effectively compress trajectory data under road network constraints. Different from existing work, PRESS proposes a novel representation for trajectories to separate the spatial representation of a trajectory from the temporal representation, and proposes a\n            <jats:italic>Hybrid Spatial Compression<\/jats:italic>\n            (HSC) algorithm and error\n            <jats:italic>Bounded Temporal Compression<\/jats:italic>\n            (BTC) algorithm to compress the spatial and temporal information of trajectories respectively. PRESS also supports common spatial-temporal queries without fully decompressing the data. Through an extensive experimental study on real trajectory dataset, PRESS significantly outperforms existing approaches in terms of saving storage cost of trajectory data with bounded errors.\n          <\/jats:p>","DOI":"10.14778\/2732939.2732940","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"661-672","source":"Crossref","is-referenced-by-count":116,"title":["PRESS"],"prefix":"10.14778","volume":"7","author":[{"given":"Renchu","family":"Song","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China and Fudan University, Shanghai, China"}]},{"given":"Weiwei","family":"Sun","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China and Fudan University, Shanghai, China"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore"}]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2014,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/366573.366611"},{"key":"e_1_2_1_3_1","first-page":"853","volume-title":"VLDB'05","author":"Brakatsoulas Sotiris","year":"2005","unstructured":"Sotiris Brakatsoulas , Dieter Pfoser , Randall Salas , and Carola Wenk . On map-matching vehicle tracking data . In VLDB'05 , pages 853 -- 864 , 2005 . Sotiris Brakatsoulas, Dieter Pfoser, Randall Salas, and Carola Wenk. On map-matching vehicle tracking data. In VLDB'05, pages 853--864, 2005."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_12"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_2_1_6_1","volume-title":"Morgan Kaufmann","author":"Han Jiawei","year":"2006","unstructured":"Jiawei Han , Micheline Kamber , and Jian Pei . Data mining: concepts and techniques . Morgan Kaufmann , 2006 . Jiawei Han, Micheline Kamber, and Jian Pei. Data mining: concepts and techniques. Morgan Kaufmann, 2006."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/902273"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_1_9_1","volume-title":"Addison-Wesley","author":"Kauth Donald E.","year":"1973","unstructured":"Donald E. Kauth . The art of computer programming: Volume 3\/Sorting and searching . Addison-Wesley , 1973 . Donald E. Kauth. The art of computer programming: Volume 3\/Sorting and searching. Addison-Wesley, 1973."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2013.01.071"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.657889"},{"key":"e_1_2_1_12_1","first-page":"239","volume-title":"KDD'98","author":"Eamonn","year":"1998","unstructured":"Eamonn J. Keogh and Michael J. Pazzani. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback . In KDD'98 , pages 239 -- 243 , 1998 . Eamonn J. Keogh and Michael J. Pazzani. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In KDD'98, pages 239--243, 1998."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653820"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465287"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1559\/152304086783900059"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_44"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869847"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-013-0184-0"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653818"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2006.45"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424428"},{"key":"e_1_2_1_22_1","volume-title":"Press: A novel framework of trajectory compression in road networks (http:\/\/arxiv.org\/abs\/1402.1546). Technical report","author":"Song Renchu","year":"2014","unstructured":"Renchu Song , Weiwei Sun , Baihua Zheng , and Yu Zheng . Press: A novel framework of trajectory compression in road networks (http:\/\/arxiv.org\/abs\/1402.1546). Technical report , 2014 . Renchu Song, Weiwei Sun, Baihua Zheng, and Yu Zheng. Press: A novel framework of trajectory compression in road networks (http:\/\/arxiv.org\/abs\/1402.1546). Technical report, 2014."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140104.1140110"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0042-x"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2124413"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732939.2732940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:21:02Z","timestamp":1672222862000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732939.2732940"}},"subtitle":["a novel framework of trajectory compression in road networks"],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["10.14778\/2732939.2732940"],"URL":"https:\/\/doi.org\/10.14778\/2732939.2732940","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,5]]}}}