A novel representation and compression for queries on trajectories in road networks

Recording and querying time-stamped trajectories incurs high cost of data storage and computing. In this paper, we explore several characteristics of the trajectories in road mbox{networks}, which have motivated the idea of coding trajectories by associating timestamps with relative spatial path and...

Full description

Saved in:
Bibliographic Details
Main Authors: YANG, Xiaochun, WANG, Bin, YANG, Kai, LIU, Chengfei, ZHENG, Baihua
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2018
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/3870
https://ink.library.smu.edu.sg/context/sis_research/article/4872/viewcontent/08119585.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-4872
record_format dspace
spelling sg-smu-ink.sis_research-48722021-03-26T05:14:16Z A novel representation and compression for queries on trajectories in road networks YANG, Xiaochun WANG, Bin YANG, Kai LIU, Chengfei ZHENG, Baihua Recording and querying time-stamped trajectories incurs high cost of data storage and computing. In this paper, we explore several characteristics of the trajectories in road mbox{networks}, which have motivated the idea of coding trajectories by associating timestamps with relative spatial path and locations. Such a representation contains large number of duplicate information to achieve a lower entropy compared with the existing representations, thereby drastically cutting the storage cost. We propose several techniques to compress spatial path and locations separately, which can support fast positioning and achieve better compression ratio. For locations, we propose two novel encoding schemes such that the binary code can preserve distance information, which is very helpful for mbox{LBS} applications. In addition, an unresolved question in this area is whether it is possible to perform search directly on the compressed trajectories, and if the answer is yes, then how. Here we show that directly querying compressed trajectories based on our encoding scheme is possible and can be done efficiently. We design a set of primitive operations for this purpose, and propose index structures to reduce query response time. We demonstrate the advantage of our method and compare it against existing ones through a thorough experimental study on real trajectories in road network. IEEE 2018-04-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3870 info:doi/10.1109/TKDE.2017.2776927 https://ink.library.smu.edu.sg/context/sis_research/article/4872/viewcontent/08119585.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Compression Encoding Entropy Memory Presses Query processing Representation Road network Roads Trajectory Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Compression
Encoding
Entropy
Memory
Presses
Query processing
Representation
Road network
Roads Trajectory
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Compression
Encoding
Entropy
Memory
Presses
Query processing
Representation
Road network
Roads Trajectory
Databases and Information Systems
Numerical Analysis and Scientific Computing
YANG, Xiaochun
WANG, Bin
YANG, Kai
LIU, Chengfei
ZHENG, Baihua
A novel representation and compression for queries on trajectories in road networks
description Recording and querying time-stamped trajectories incurs high cost of data storage and computing. In this paper, we explore several characteristics of the trajectories in road mbox{networks}, which have motivated the idea of coding trajectories by associating timestamps with relative spatial path and locations. Such a representation contains large number of duplicate information to achieve a lower entropy compared with the existing representations, thereby drastically cutting the storage cost. We propose several techniques to compress spatial path and locations separately, which can support fast positioning and achieve better compression ratio. For locations, we propose two novel encoding schemes such that the binary code can preserve distance information, which is very helpful for mbox{LBS} applications. In addition, an unresolved question in this area is whether it is possible to perform search directly on the compressed trajectories, and if the answer is yes, then how. Here we show that directly querying compressed trajectories based on our encoding scheme is possible and can be done efficiently. We design a set of primitive operations for this purpose, and propose index structures to reduce query response time. We demonstrate the advantage of our method and compare it against existing ones through a thorough experimental study on real trajectories in road network. IEEE
format text
author YANG, Xiaochun
WANG, Bin
YANG, Kai
LIU, Chengfei
ZHENG, Baihua
author_facet YANG, Xiaochun
WANG, Bin
YANG, Kai
LIU, Chengfei
ZHENG, Baihua
author_sort YANG, Xiaochun
title A novel representation and compression for queries on trajectories in road networks
title_short A novel representation and compression for queries on trajectories in road networks
title_full A novel representation and compression for queries on trajectories in road networks
title_fullStr A novel representation and compression for queries on trajectories in road networks
title_full_unstemmed A novel representation and compression for queries on trajectories in road networks
title_sort novel representation and compression for queries on trajectories in road networks
publisher Institutional Knowledge at Singapore Management University
publishDate 2018
url https://ink.library.smu.edu.sg/sis_research/3870
https://ink.library.smu.edu.sg/context/sis_research/article/4872/viewcontent/08119585.pdf
_version_ 1770573869077233664