Access the full text.
Sign up today, get DeepDyve free for 14 days.
S Bowers, S Workflow (2012)
Provenance, and data modeling challenges and approachesJ Data Semant, 1
DH Douglas, TK Peucker (1973)
Algorithms for the reduction of the number of points required to represent a line or its caricatureCan Cartogr, 10
J Gudmundsson, J Katajainen, D Merrick, C Ong, T Wolle (2007)
Compressing spatio-temporal trajectoriesLNCS, 4835
Y Ma, W Haiping, L Wang, B Huang, R Ranjan, AY Zomaya, W Jie (2015)
Remote sensing big data computing: challenges and opportunitiesFuture Gen Comput Syst, 51
J Diaz, C Muñoz-Caro, A Niño (2012)
A survey of parallel programming modelsand tools in the multi and many-core eraIEEE Trans Parallel Distrib Syst, 23
J Liu, K Zhao, P Sommer, S Shang, B Kusy, J-G Lee, R Jurdak (2016)
A novel framework for online amnesic trajectory compression in resource constrained environmentsIEEE Trans Knowl Data Eng, 28
L Wang, J Zhang, P Liu, K-KR Choo, F Huang (2017)
Spectral-spatial multi-feature-based deep learning for hyperspectral remote sensing image classificationSoft Comput, 21
F Huang, J Tao, Y Xiang, P Liu, L Dong, L Wang (2017)
Parallel compressive sampling matching pursuit algorithm for compressed sensing signal reconstruction with OpenCLJ Syst Archit Embed Syst Des, 72
C Guo, Y Fang, JN Liu, Y Wan (2013)
Study on social awareness computation methods for location-based servicesJ Comput Res Dev, 50
L Wang, H Geng, P Liu, L Ke, J Kolodziej, R Ranjan, AY Zomaya (2015)
Particle swarm optimization based dictionary learning for remote sensing big dataKnowl Based Syst, 79
Y Chen, L Wang, F Li, D Bo, K-KR Choo, H Hassan, W Qin (2017)
Air quality data clustering using EPLS methodInf Fusion, 36
N Meratnia, RA By (2004)
Spatiotemporal compression techniques for moving point objectsLNCS, 2992
L Wang, W Song, P Liu (2016)
Link the remote sensing big data to the image features via wavelet transformationClust Comput, 19
W Song, P Liu, L Wang (2016)
Sparse representation-based correlation analysis of non-stationary spatiotemporal big dataInt J Digit Earth, 9
RE Bryant (2011)
Data-intensive scalable computing for scientific applicationsComput Sci Eng, 13
JS Vitter (1985)
Random sampling with a reservoirACM TOMS, 11
Y Miao, L Wang, D Liu, Y Ma, W Zhang, L Chen (2015)
A Web 2.0-based science gateway for massive remote sensing image processingConcurr Comput Pract Exp, 27
CLP Chen, C-Y Zhang (2014)
Data-intensive applications, challenges, techniques and technologies: a survey on big dataInf Sci, 275
J Muckell, PW Olsen, J-H Hwang, CT Lawson, SS Ravi (2014)
Compression of trajectory data: a comprehensive evaluation and new approachGeoinformatica, 18
B Chapman, G Jost, R Pas (2007)
OpenMP: portable shared memory parallel programming
L Wang, L Ke, P Liu, R Ranjan, L Chen (2014)
IK-SVD: dictionary learning for spatial big data via incremental atom updateComput Sci Eng, 16
R Lange, F Drr, K Rothermel (2011)
Efficient real-time trajectory trackingVLDB J, 20
Y Zheng, X Xie, WY Ma (2010)
Geolife: a collaborative social networking service among user, location and trajectoryIEEE Data Eng Bull, 33
Nowadays with booming of sensor technology, location big data exhibit as high complexity, massive volume, real-time and stream-based characteristic. The current workflow systems are facing the challenge hardly to efficiently process the real-time location big data like trajectory stream. Online compression method is an available solution to preprocess these trajectory data in order to speed up the processing of big data workflow. However, the current online compression methods are in a serial execution that are hard to fast compress massive real-time original trajectory data. Aiming at this problem, we employ the multi-core and many-core approaches to accelerate a representative online trajectory compression method SQUISH-E. First a parallel version of SQUISH-E is proposed. PSQUISH-E used a data parallel scheme based on overlap technique and OpenMP to achieve the implementation over multiple-core CPUs. For further reducing compression time, we combine iteration method and GPU Hyper-Q feature to develop GPU-aided PSQUISH-E algorithm called as G-PSQUISH-E. The experimental results showed that (1) the data parallel scheme based on overlap can reach a similar SED error as the SQUISH-E (2) the proposed PSQUISH-E running on multi-core CPU achieved 3.8 times acceleration effect, and (3) G-PSQUISH-E further accelerated the effect of about 3 times compared with PSQUISH-E.
Computing – Springer Journals
Published: Jun 20, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.