{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:53:28Z","timestamp":1760241208884,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The need to store massive volumes of spatio-temporal data has become a difficult task as GPS capabilities and wireless communication technologies have become prevalent to modern mobile devices. As a result, massive trajectory data are produced, incurring expensive costs for storage, transmission, as well as query processing. A number of algorithms for compressing trajectory data have been proposed in order to overcome these difficulties. These algorithms try to reduce the size of trajectory data, while preserving the quality of the information. In the context of this research work, we focus on both the privacy preservation and storage problem of spatio-temporal databases. To alleviate this issue, we propose an efficient framework for trajectories representation, entitled DUST (DUal-based Spatio-temporal Trajectory), by which a raw trajectory is split into a number of linear sub-trajectories which are subjected to dual transformation that formulates the representatives of each linear component of initial trajectory; thus, the compressed trajectory achieves compression ratio equal to     M : 1    . To our knowledge, we are the first to study and address k-NN queries on nonlinear moving object trajectories that are represented in dual dimensional space. Additionally, the proposed approach is expected to reinforce the privacy protection of such data. Specifically, even in case that an intruder has access to the dual points of trajectory data and try to reproduce the native points that fit a specific component of the initial trajectory, the identity of the mobile object will remain secure with high probability. In this way, the privacy of the k-anonymity method is reinforced. Through experiments on real spatial datasets, we evaluate the robustness of the new approach and compare it with the one studied in our previous work.<\/jats:p>","DOI":"10.3390\/a12120266","type":"journal-article","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T03:20:16Z","timestamp":1576120816000},"page":"266","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Storage Efficient Trajectory Clustering and k-NN for Robust Privacy Preserving Spatio-Temporal Databases"],"prefix":"10.3390","volume":"12","author":[{"given":"Elias","family":"Dritsas","sequence":"first","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece"}]},{"given":"Andreas","family":"Kanavos","sequence":"additional","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7793-0407","authenticated-orcid":false,"given":"Maria","family":"Trigka","sequence":"additional","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece"}]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[{"name":"Computer Engineering and Informatics Department, University of Patras, 26504 Patras, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s13218-012-0215-2","article-title":"spatio-temporal Modeling and Analysis\u2014Introduction and Overview","volume":"26","author":"May","year":"2012","journal-title":"K\u00fcnstliche Intell. KI"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2056","DOI":"10.1109\/ACCESS.2016.2553681","article-title":"A Survey on Trajectory data-mining: Techniques and Applications","volume":"4","author":"Feng","year":"2016","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.comgeo.2009.02.002","article-title":"Compressing Spatio-temporal Trajectories","volume":"42","author":"Gudmundsson","year":"2009","journal-title":"Comput. Geom."},{"key":"ref_4","first-page":"11","article-title":"COMPRESS: A Comprehensive Framework of Trajectory Compression in Road Networks","volume":"42","author":"Han","year":"2017","journal-title":"ACM Trans. Database Syst. TODS"},{"key":"ref_5","first-page":"661","article-title":"PRESS: A Novel Framework of Trajectory Compression in Road Networks","volume":"7","author":"Song","year":"2014","journal-title":"PVLDB"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Hasan, A.S.M.T., Qu, Q., Li, C., Chen, L., and Jiang, Q. (2018). An Effective Privacy Architecture to Preserve User Trajectories in Reward-Based LBS Applications. ISPRS Int. J. Geo-Inf., 7.","DOI":"10.3390\/ijgi7020053"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ins.2016.08.010","article-title":"Collaborative Trajectory privacy preservation Scheme in Location-based Services","volume":"387","author":"Peng","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ye, H., Cheng, X., Yuan, M., Xu, L., Gao, J., and Cheng, C. (2016, January 26\u201328). A Survey of Security and Privacy in Big Data. Proceedings of the 16th International Symposium on Communications and Information Technologies (ISCIT), Qingdao, China.","DOI":"10.1109\/ISCIT.2016.7751634"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Dritsas, E., Trigka, M., Gerolymatos, P., and Sioutas, S. (2018). Trajectory Clustering and k-NN for Robust privacy preservation spatio-temporal Databases. Algorithms, 11.","DOI":"10.3390\/a11120207"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Verykios, V.S., Damiani, M.L., and Gkoulalas-Divanis, A. (2008). Privacy and Security in spatio-temporal Data and Trajectories. Mobility, Data-Mining and Privacy, Springer.","DOI":"10.1007\/978-3-540-75177-9_9"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Poulis, G., Skiadopoulos, S., Loukides, G., and Gkoulalas-Divanis, A. (2013, January 3\u20136). Distance-Based k^m-Anonymization of Trajectory Data. Proceedings of the 14th IEEE International Conference on Mobile Data Management (MDM), Milan, Italy.","DOI":"10.1109\/MDM.2013.66"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jss.2015.03.068","article-title":"SMaRT: A Novel Framework for Addressing Range Queries over Nonlinear Trajectories","volume":"105","author":"Gerolymatos","year":"2015","journal-title":"J. Syst. Softw. JSS"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Mao, Y., Zhong, H., Qi, H., Ping, P., and Li, X. (2017). An Adaptive Trajectory Clustering Method Based on Grid and Density in Mobile Pattern Analysis. Sensors, 17.","DOI":"10.3390\/s17092013"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2016\/8472703","article-title":"An Overview of Moving Object Trajectory Compression Algorithms","volume":"2016","author":"Sun","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10462-016-9477-7","article-title":"A Review of Moving Object Trajectory Clustering Algorithms","volume":"47","author":"Yuan","year":"2017","journal-title":"Artif. Intell. Rev."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Basu, A., Monreale, A., Corena, J.C., Giannotti, F., Pedreschi, D., Kiyomoto, S., Miyake, Y., Yanagihara, T., and Trasarti, R. (2014, January 7\u201310). A Privacy Risk Model for Trajectory Data. Proceedings of the 8th IFIP International Conference on Trust Management, Singapore.","DOI":"10.1007\/978-3-662-43813-8_9"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yakoubov, S., Gadepally, V., Schear, N., Shen, E., and Yerukhimovich, A. (2014, January 9\u201311). A Survey of Cryptographic Approaches to Securing Big-Data Analytics in the Cloud. Proceedings of the IEEE High Performance Extreme Computing Conference (HPEC), Waltham, MA, USA.","DOI":"10.1109\/HPEC.2014.7040943"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Lee, J., Han, J., and Whang, K. (2007, January 11\u201314). Trajectory Clustering: A Partition-and-Group Framework. Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China.","DOI":"10.1145\/1247480.1247546"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1109\/TKDE.2011.39","article-title":"Segmentation and Sampling of Moving Object Trajectories Based on Representativeness","volume":"24","author":"Panagiotakis","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng. TKDE"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Shi, Z., and Pun-Cheng, L.S.C. (2019). spatio-temporal Data Clustering: A Survey of Methods. ISPRS Int. J. Geo-Inf., 8.","DOI":"10.3390\/ijgi8030112"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Li, X., Zhao, K., Cong, G., Jensen, C.S., and Wei, W. (2018, January 16\u201319). Deep Representation Learning for Trajectory Similarity Computation. Proceedings of the 34th IEEE International Conference on Data Engineering (ICDE), Paris, France.","DOI":"10.1109\/ICDE.2018.00062"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Z\u00fcfle, A., Emrich, T., Schmid, K.A., Mamoulis, N., Zimek, A., and Renz, M. (2014, January 24\u201327). Representative Clustering of Uncertain Data. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623725"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/12\/266\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:41:23Z","timestamp":1760190083000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/12\/266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,11]]},"references-count":22,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["a12120266"],"URL":"https:\/\/doi.org\/10.3390\/a12120266","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,12,11]]}}}