One-pass trajectory simplification using the synchronous Euclidean distance
Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Lin, Xuelian [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag GmbH Germany, part of Springer Nature 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The VLDB journal - Springer Berlin Heidelberg, 1992, 28(2019), 6 vom: 04. Okt., Seite 897-921 |
|---|---|
| Übergeordnetes Werk: |
volume:28 ; year:2019 ; number:6 ; day:04 ; month:10 ; pages:897-921 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00778-019-00575-8 |
|---|
| Katalog-ID: |
OLC2051362173 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2051362173 | ||
| 003 | DE-627 | ||
| 005 | 20230502152020.0 | ||
| 007 | tu | ||
| 008 | 200819s2019 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00778-019-00575-8 |2 doi | |
| 035 | |a (DE-627)OLC2051362173 | ||
| 035 | |a (DE-He213)s00778-019-00575-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Lin, Xuelian |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a One-pass trajectory simplification using the synchronous Euclidean distance |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag GmbH Germany, part of Springer Nature 2019 | ||
| 520 | |a Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. | ||
| 650 | 4 | |a Trajectory simplification | |
| 650 | 4 | |a Synchronous Euclidean distance | |
| 650 | 4 | |a One-pass line simplification | |
| 700 | 1 | |a Jiang, Jiahao |4 aut | |
| 700 | 1 | |a Ma, Shuai |0 (orcid)0000-0002-4050-0443 |4 aut | |
| 700 | 1 | |a Zuo, Yimeng |4 aut | |
| 700 | 1 | |a Hu, Chunming |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The VLDB journal |d Springer Berlin Heidelberg, 1992 |g 28(2019), 6 vom: 04. Okt., Seite 897-921 |w (DE-627)170933059 |w (DE-600)1129061-4 |w (DE-576)032856466 |x 1066-8888 |7 nnns |
| 773 | 1 | 8 | |g volume:28 |g year:2019 |g number:6 |g day:04 |g month:10 |g pages:897-921 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00778-019-00575-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4277 | ||
| 951 | |a AR | ||
| 952 | |d 28 |j 2019 |e 6 |b 04 |c 10 |h 897-921 | ||
| author_variant |
x l xl j j jj s m sm y z yz c h ch |
|---|---|
| matchkey_str |
article:10668888:2019----::npstaetrsmlfctouighsnhoo |
| hierarchy_sort_str |
2019 |
| publishDate |
2019 |
| allfields |
10.1007/s00778-019-00575-8 doi (DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p DE-627 ger DE-627 rakwb eng 004 VZ Lin, Xuelian verfasserin aut One-pass trajectory simplification using the synchronous Euclidean distance 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2019 Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. Trajectory simplification Synchronous Euclidean distance One-pass line simplification Jiang, Jiahao aut Ma, Shuai (orcid)0000-0002-4050-0443 aut Zuo, Yimeng aut Hu, Chunming aut Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 28(2019), 6 vom: 04. Okt., Seite 897-921 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:28 year:2019 number:6 day:04 month:10 pages:897-921 https://doi.org/10.1007/s00778-019-00575-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 AR 28 2019 6 04 10 897-921 |
| spelling |
10.1007/s00778-019-00575-8 doi (DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p DE-627 ger DE-627 rakwb eng 004 VZ Lin, Xuelian verfasserin aut One-pass trajectory simplification using the synchronous Euclidean distance 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2019 Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. Trajectory simplification Synchronous Euclidean distance One-pass line simplification Jiang, Jiahao aut Ma, Shuai (orcid)0000-0002-4050-0443 aut Zuo, Yimeng aut Hu, Chunming aut Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 28(2019), 6 vom: 04. Okt., Seite 897-921 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:28 year:2019 number:6 day:04 month:10 pages:897-921 https://doi.org/10.1007/s00778-019-00575-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 AR 28 2019 6 04 10 897-921 |
| allfields_unstemmed |
10.1007/s00778-019-00575-8 doi (DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p DE-627 ger DE-627 rakwb eng 004 VZ Lin, Xuelian verfasserin aut One-pass trajectory simplification using the synchronous Euclidean distance 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2019 Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. Trajectory simplification Synchronous Euclidean distance One-pass line simplification Jiang, Jiahao aut Ma, Shuai (orcid)0000-0002-4050-0443 aut Zuo, Yimeng aut Hu, Chunming aut Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 28(2019), 6 vom: 04. Okt., Seite 897-921 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:28 year:2019 number:6 day:04 month:10 pages:897-921 https://doi.org/10.1007/s00778-019-00575-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 AR 28 2019 6 04 10 897-921 |
| allfieldsGer |
10.1007/s00778-019-00575-8 doi (DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p DE-627 ger DE-627 rakwb eng 004 VZ Lin, Xuelian verfasserin aut One-pass trajectory simplification using the synchronous Euclidean distance 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2019 Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. Trajectory simplification Synchronous Euclidean distance One-pass line simplification Jiang, Jiahao aut Ma, Shuai (orcid)0000-0002-4050-0443 aut Zuo, Yimeng aut Hu, Chunming aut Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 28(2019), 6 vom: 04. Okt., Seite 897-921 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:28 year:2019 number:6 day:04 month:10 pages:897-921 https://doi.org/10.1007/s00778-019-00575-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 AR 28 2019 6 04 10 897-921 |
| allfieldsSound |
10.1007/s00778-019-00575-8 doi (DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p DE-627 ger DE-627 rakwb eng 004 VZ Lin, Xuelian verfasserin aut One-pass trajectory simplification using the synchronous Euclidean distance 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag GmbH Germany, part of Springer Nature 2019 Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. Trajectory simplification Synchronous Euclidean distance One-pass line simplification Jiang, Jiahao aut Ma, Shuai (orcid)0000-0002-4050-0443 aut Zuo, Yimeng aut Hu, Chunming aut Enthalten in The VLDB journal Springer Berlin Heidelberg, 1992 28(2019), 6 vom: 04. Okt., Seite 897-921 (DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 1066-8888 nnns volume:28 year:2019 number:6 day:04 month:10 pages:897-921 https://doi.org/10.1007/s00778-019-00575-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 AR 28 2019 6 04 10 897-921 |
| language |
English |
| source |
Enthalten in The VLDB journal 28(2019), 6 vom: 04. Okt., Seite 897-921 volume:28 year:2019 number:6 day:04 month:10 pages:897-921 |
| sourceStr |
Enthalten in The VLDB journal 28(2019), 6 vom: 04. Okt., Seite 897-921 volume:28 year:2019 number:6 day:04 month:10 pages:897-921 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Trajectory simplification Synchronous Euclidean distance One-pass line simplification |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The VLDB journal |
| authorswithroles_txt_mv |
Lin, Xuelian @@aut@@ Jiang, Jiahao @@aut@@ Ma, Shuai @@aut@@ Zuo, Yimeng @@aut@@ Hu, Chunming @@aut@@ |
| publishDateDaySort_date |
2019-10-04T00:00:00Z |
| hierarchy_top_id |
170933059 |
| dewey-sort |
14 |
| id |
OLC2051362173 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051362173</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502152020.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00778-019-00575-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051362173</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00778-019-00575-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lin, Xuelian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">One-pass trajectory simplification using the synchronous Euclidean distance</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trajectory simplification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synchronous Euclidean distance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">One-pass line simplification</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jiang, Jiahao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Shuai</subfield><subfield code="0">(orcid)0000-0002-4050-0443</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zuo, Yimeng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hu, Chunming</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The VLDB journal</subfield><subfield code="d">Springer Berlin Heidelberg, 1992</subfield><subfield code="g">28(2019), 6 vom: 04. Okt., Seite 897-921</subfield><subfield code="w">(DE-627)170933059</subfield><subfield code="w">(DE-600)1129061-4</subfield><subfield code="w">(DE-576)032856466</subfield><subfield code="x">1066-8888</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:6</subfield><subfield code="g">day:04</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:897-921</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00778-019-00575-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2019</subfield><subfield code="e">6</subfield><subfield code="b">04</subfield><subfield code="c">10</subfield><subfield code="h">897-921</subfield></datafield></record></collection>
|
| author |
Lin, Xuelian |
| spellingShingle |
Lin, Xuelian ddc 004 misc Trajectory simplification misc Synchronous Euclidean distance misc One-pass line simplification One-pass trajectory simplification using the synchronous Euclidean distance |
| authorStr |
Lin, Xuelian |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)170933059 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1066-8888 |
| topic_title |
004 VZ One-pass trajectory simplification using the synchronous Euclidean distance Trajectory simplification Synchronous Euclidean distance One-pass line simplification |
| topic |
ddc 004 misc Trajectory simplification misc Synchronous Euclidean distance misc One-pass line simplification |
| topic_unstemmed |
ddc 004 misc Trajectory simplification misc Synchronous Euclidean distance misc One-pass line simplification |
| topic_browse |
ddc 004 misc Trajectory simplification misc Synchronous Euclidean distance misc One-pass line simplification |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The VLDB journal |
| hierarchy_parent_id |
170933059 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
The VLDB journal |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)170933059 (DE-600)1129061-4 (DE-576)032856466 |
| title |
One-pass trajectory simplification using the synchronous Euclidean distance |
| ctrlnum |
(DE-627)OLC2051362173 (DE-He213)s00778-019-00575-8-p |
| title_full |
One-pass trajectory simplification using the synchronous Euclidean distance |
| author_sort |
Lin, Xuelian |
| journal |
The VLDB journal |
| journalStr |
The VLDB journal |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| container_start_page |
897 |
| author_browse |
Lin, Xuelian Jiang, Jiahao Ma, Shuai Zuo, Yimeng Hu, Chunming |
| container_volume |
28 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Lin, Xuelian |
| doi_str_mv |
10.1007/s00778-019-00575-8 |
| normlink |
(ORCID)0000-0002-4050-0443 |
| normlink_prefix_str_mv |
(orcid)0000-0002-4050-0443 |
| dewey-full |
004 |
| title_sort |
one-pass trajectory simplification using the synchronous euclidean distance |
| title_auth |
One-pass trajectory simplification using the synchronous Euclidean distance |
| abstract |
Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. © Springer-Verlag GmbH Germany, part of Springer Nature 2019 |
| abstractGer |
Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. © Springer-Verlag GmbH Germany, part of Springer Nature 2019 |
| abstract_unstemmed |
Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively. © Springer-Verlag GmbH Germany, part of Springer Nature 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4277 |
| container_issue |
6 |
| title_short |
One-pass trajectory simplification using the synchronous Euclidean distance |
| url |
https://doi.org/10.1007/s00778-019-00575-8 |
| remote_bool |
false |
| author2 |
Jiang, Jiahao Ma, Shuai Zuo, Yimeng Hu, Chunming |
| author2Str |
Jiang, Jiahao Ma, Shuai Zuo, Yimeng Hu, Chunming |
| ppnlink |
170933059 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00778-019-00575-8 |
| up_date |
2024-07-04T04:13:10.186Z |
| _version_ |
1803620335156723712 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051362173</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502152020.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00778-019-00575-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051362173</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00778-019-00575-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lin, Xuelian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">One-pass trajectory simplification using the synchronous Euclidean distance</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag GmbH Germany, part of Springer Nature 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network bandwidth and computing resource. To attack this issue, one-pass line simplification ($$\textsf {LS} $$) algorithms have been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algorithms adopt the perpendicular Euclidean distance, and none of them uses the synchronous Euclidean distance ($$\textsf {SED} $$), and cannot support spatiotemporal queries. To do this, we develop two one-pass error bounded trajectory simplification algorithms ($$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$) using $$\textsf {SED} $$, based on a novel spatiotemporal cone intersection technique. Using four real-life trajectory datasets, we experimentally show that our approaches are both efficient and effective. In terms of running time, algorithms $$\textsf {CISED} $$-$$\textsf {S} $$ and $$\textsf {CISED} $$-$$\textsf {W} $$ are on average 3 times faster than $$\textsf {SQUISH} $$-$$\textsf {E} $$ (the fastest existing $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$). In terms of compression ratios, $$\textsf {CISED} $$-$$\textsf {S} $$ is close to and $$\textsf {CISED} $$-$$\textsf {W} $$ is on average $$19.6\%$$ better than $$\textsf {DPSED} $$ (the existing sub-optimal $$\textsf {LS} $$ algorithm using $$\textsf {SED} $$ and having the best compression ratios), and they are $$21.1\%$$ and $$42.4\%$$ better than $$\textsf {SQUISH} $$-$$\textsf {E} $$ on average, respectively.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trajectory simplification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synchronous Euclidean distance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">One-pass line simplification</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jiang, Jiahao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Shuai</subfield><subfield code="0">(orcid)0000-0002-4050-0443</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zuo, Yimeng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hu, Chunming</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The VLDB journal</subfield><subfield code="d">Springer Berlin Heidelberg, 1992</subfield><subfield code="g">28(2019), 6 vom: 04. Okt., Seite 897-921</subfield><subfield code="w">(DE-627)170933059</subfield><subfield code="w">(DE-600)1129061-4</subfield><subfield code="w">(DE-576)032856466</subfield><subfield code="x">1066-8888</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:6</subfield><subfield code="g">day:04</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:897-921</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00778-019-00575-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2019</subfield><subfield code="e">6</subfield><subfield code="b">04</subfield><subfield code="c">10</subfield><subfield code="h">897-921</subfield></datafield></record></collection>
|
| score |
7.3986425 |