Efficient route search on hierarchical dynamic road networks
Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, rou...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Xu, Jiajie [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2014 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Distributed and parallel databases - Springer US, 1993, 33(2014), 2 vom: 02. März, Seite 227-252 |
|---|---|
| Übergeordnetes Werk: |
volume:33 ; year:2014 ; number:2 ; day:02 ; month:03 ; pages:227-252 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10619-014-7146-x |
|---|
| Katalog-ID: |
OLC2027067590 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2027067590 | ||
| 003 | DE-627 | ||
| 005 | 20230503034750.0 | ||
| 007 | tu | ||
| 008 | 200819s2014 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10619-014-7146-x |2 doi | |
| 035 | |a (DE-627)OLC2027067590 | ||
| 035 | |a (DE-He213)s10619-014-7146-x-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 070 |a 020 |a 004 |q VZ |
| 084 | |a 24,1 |2 ssgn | ||
| 100 | 1 | |a Xu, Jiajie |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Efficient route search on hierarchical dynamic road networks |
| 264 | 1 | |c 2014 | |
| 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 Science+Business Media New York 2014 | ||
| 520 | |a Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. | ||
| 650 | 4 | |a Route planning | |
| 650 | 4 | |a Road networks | |
| 650 | 4 | |a Road hierarchy | |
| 650 | 4 | |a Dynamic road networks | |
| 650 | 4 | |a Spatio-temporal analysis | |
| 650 | 4 | |a Query processing | |
| 700 | 1 | |a Gao, Yunjun |4 aut | |
| 700 | 1 | |a Liu, Chengfei |4 aut | |
| 700 | 1 | |a Zhao, Lei |4 aut | |
| 700 | 1 | |a Ding, Zhiming |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Distributed and parallel databases |d Springer US, 1993 |g 33(2014), 2 vom: 02. März, Seite 227-252 |w (DE-627)165664401 |w (DE-600)913166-8 |w (DE-576)038480352 |x 0926-8782 |7 nnns |
| 773 | 1 | 8 | |g volume:33 |g year:2014 |g number:2 |g day:02 |g month:03 |g pages:227-252 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10619-014-7146-x |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4318 | ||
| 951 | |a AR | ||
| 952 | |d 33 |j 2014 |e 2 |b 02 |c 03 |h 227-252 | ||
| author_variant |
j x jx y g yg c l cl l z lz z d zd |
|---|---|
| matchkey_str |
article:09268782:2014----::fiinrueerhnirrhclya |
| hierarchy_sort_str |
2014 |
| publishDate |
2014 |
| allfields |
10.1007/s10619-014-7146-x doi (DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p DE-627 ger DE-627 rakwb eng 070 020 004 VZ 24,1 ssgn Xu, Jiajie verfasserin aut Efficient route search on hierarchical dynamic road networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing Gao, Yunjun aut Liu, Chengfei aut Zhao, Lei aut Ding, Zhiming aut Enthalten in Distributed and parallel databases Springer US, 1993 33(2014), 2 vom: 02. März, Seite 227-252 (DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 0926-8782 nnns volume:33 year:2014 number:2 day:02 month:03 pages:227-252 https://doi.org/10.1007/s10619-014-7146-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 AR 33 2014 2 02 03 227-252 |
| spelling |
10.1007/s10619-014-7146-x doi (DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p DE-627 ger DE-627 rakwb eng 070 020 004 VZ 24,1 ssgn Xu, Jiajie verfasserin aut Efficient route search on hierarchical dynamic road networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing Gao, Yunjun aut Liu, Chengfei aut Zhao, Lei aut Ding, Zhiming aut Enthalten in Distributed and parallel databases Springer US, 1993 33(2014), 2 vom: 02. März, Seite 227-252 (DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 0926-8782 nnns volume:33 year:2014 number:2 day:02 month:03 pages:227-252 https://doi.org/10.1007/s10619-014-7146-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 AR 33 2014 2 02 03 227-252 |
| allfields_unstemmed |
10.1007/s10619-014-7146-x doi (DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p DE-627 ger DE-627 rakwb eng 070 020 004 VZ 24,1 ssgn Xu, Jiajie verfasserin aut Efficient route search on hierarchical dynamic road networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing Gao, Yunjun aut Liu, Chengfei aut Zhao, Lei aut Ding, Zhiming aut Enthalten in Distributed and parallel databases Springer US, 1993 33(2014), 2 vom: 02. März, Seite 227-252 (DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 0926-8782 nnns volume:33 year:2014 number:2 day:02 month:03 pages:227-252 https://doi.org/10.1007/s10619-014-7146-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 AR 33 2014 2 02 03 227-252 |
| allfieldsGer |
10.1007/s10619-014-7146-x doi (DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p DE-627 ger DE-627 rakwb eng 070 020 004 VZ 24,1 ssgn Xu, Jiajie verfasserin aut Efficient route search on hierarchical dynamic road networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing Gao, Yunjun aut Liu, Chengfei aut Zhao, Lei aut Ding, Zhiming aut Enthalten in Distributed and parallel databases Springer US, 1993 33(2014), 2 vom: 02. März, Seite 227-252 (DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 0926-8782 nnns volume:33 year:2014 number:2 day:02 month:03 pages:227-252 https://doi.org/10.1007/s10619-014-7146-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 AR 33 2014 2 02 03 227-252 |
| allfieldsSound |
10.1007/s10619-014-7146-x doi (DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p DE-627 ger DE-627 rakwb eng 070 020 004 VZ 24,1 ssgn Xu, Jiajie verfasserin aut Efficient route search on hierarchical dynamic road networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing Gao, Yunjun aut Liu, Chengfei aut Zhao, Lei aut Ding, Zhiming aut Enthalten in Distributed and parallel databases Springer US, 1993 33(2014), 2 vom: 02. März, Seite 227-252 (DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 0926-8782 nnns volume:33 year:2014 number:2 day:02 month:03 pages:227-252 https://doi.org/10.1007/s10619-014-7146-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 AR 33 2014 2 02 03 227-252 |
| language |
English |
| source |
Enthalten in Distributed and parallel databases 33(2014), 2 vom: 02. März, Seite 227-252 volume:33 year:2014 number:2 day:02 month:03 pages:227-252 |
| sourceStr |
Enthalten in Distributed and parallel databases 33(2014), 2 vom: 02. März, Seite 227-252 volume:33 year:2014 number:2 day:02 month:03 pages:227-252 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
Distributed and parallel databases |
| authorswithroles_txt_mv |
Xu, Jiajie @@aut@@ Gao, Yunjun @@aut@@ Liu, Chengfei @@aut@@ Zhao, Lei @@aut@@ Ding, Zhiming @@aut@@ |
| publishDateDaySort_date |
2014-03-02T00:00:00Z |
| hierarchy_top_id |
165664401 |
| dewey-sort |
270 |
| id |
OLC2027067590 |
| 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">OLC2027067590</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503034750.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10619-014-7146-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027067590</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10619-014-7146-x-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">070</subfield><subfield code="a">020</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xu, Jiajie</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient route search on hierarchical dynamic road networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</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 Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Route planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Road networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Road hierarchy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic road networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spatio-temporal analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query processing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gao, Yunjun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Chengfei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Lei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ding, Zhiming</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed and parallel databases</subfield><subfield code="d">Springer US, 1993</subfield><subfield code="g">33(2014), 2 vom: 02. März, Seite 227-252</subfield><subfield code="w">(DE-627)165664401</subfield><subfield code="w">(DE-600)913166-8</subfield><subfield code="w">(DE-576)038480352</subfield><subfield code="x">0926-8782</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:2</subfield><subfield code="g">day:02</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:227-252</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10619-014-7146-x</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">SSG-OPC-BBI</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2014</subfield><subfield code="e">2</subfield><subfield code="b">02</subfield><subfield code="c">03</subfield><subfield code="h">227-252</subfield></datafield></record></collection>
|
| author |
Xu, Jiajie |
| spellingShingle |
Xu, Jiajie ddc 070 ssgn 24,1 misc Route planning misc Road networks misc Road hierarchy misc Dynamic road networks misc Spatio-temporal analysis misc Query processing Efficient route search on hierarchical dynamic road networks |
| authorStr |
Xu, Jiajie |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165664401 |
| format |
Article |
| dewey-ones |
070 - News media, journalism & publishing 020 - Library & information sciences 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 |
0926-8782 |
| topic_title |
070 020 004 VZ 24,1 ssgn Efficient route search on hierarchical dynamic road networks Route planning Road networks Road hierarchy Dynamic road networks Spatio-temporal analysis Query processing |
| topic |
ddc 070 ssgn 24,1 misc Route planning misc Road networks misc Road hierarchy misc Dynamic road networks misc Spatio-temporal analysis misc Query processing |
| topic_unstemmed |
ddc 070 ssgn 24,1 misc Route planning misc Road networks misc Road hierarchy misc Dynamic road networks misc Spatio-temporal analysis misc Query processing |
| topic_browse |
ddc 070 ssgn 24,1 misc Route planning misc Road networks misc Road hierarchy misc Dynamic road networks misc Spatio-temporal analysis misc Query processing |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Distributed and parallel databases |
| hierarchy_parent_id |
165664401 |
| dewey-tens |
070 - News media, journalism & publishing 020 - Library & information sciences 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Distributed and parallel databases |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165664401 (DE-600)913166-8 (DE-576)038480352 |
| title |
Efficient route search on hierarchical dynamic road networks |
| ctrlnum |
(DE-627)OLC2027067590 (DE-He213)s10619-014-7146-x-p |
| title_full |
Efficient route search on hierarchical dynamic road networks |
| author_sort |
Xu, Jiajie |
| journal |
Distributed and parallel databases |
| journalStr |
Distributed and parallel databases |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
227 |
| author_browse |
Xu, Jiajie Gao, Yunjun Liu, Chengfei Zhao, Lei Ding, Zhiming |
| container_volume |
33 |
| class |
070 020 004 VZ 24,1 ssgn |
| format_se |
Aufsätze |
| author-letter |
Xu, Jiajie |
| doi_str_mv |
10.1007/s10619-014-7146-x |
| dewey-full |
070 020 004 |
| title_sort |
efficient route search on hierarchical dynamic road networks |
| title_auth |
Efficient route search on hierarchical dynamic road networks |
| abstract |
Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. © Springer Science+Business Media New York 2014 |
| abstractGer |
Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. © Springer Science+Business Media New York 2014 |
| abstract_unstemmed |
Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies. © Springer Science+Business Media New York 2014 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4126 GBV_ILN_4318 |
| container_issue |
2 |
| title_short |
Efficient route search on hierarchical dynamic road networks |
| url |
https://doi.org/10.1007/s10619-014-7146-x |
| remote_bool |
false |
| author2 |
Gao, Yunjun Liu, Chengfei Zhao, Lei Ding, Zhiming |
| author2Str |
Gao, Yunjun Liu, Chengfei Zhao, Lei Ding, Zhiming |
| ppnlink |
165664401 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10619-014-7146-x |
| up_date |
2024-07-03T13:39:24.161Z |
| _version_ |
1803565362495619072 |
| 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">OLC2027067590</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503034750.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10619-014-7146-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2027067590</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10619-014-7146-x-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">070</subfield><subfield code="a">020</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Xu, Jiajie</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient route search on hierarchical dynamic road networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</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 Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The widespread use of GPS navigations and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mostly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in the presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this paper, two efficient strategies are proposed to handle this problem. We analyze the traffic condition on the road network and explore spatio-temporal knowledge to guide effective route planning. In particular, several effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates. A comprehensive experiment is also conducted to evaluate the performance of our proposed strategies.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Route planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Road networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Road hierarchy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic road networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spatio-temporal analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query processing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gao, Yunjun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Chengfei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Lei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ding, Zhiming</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed and parallel databases</subfield><subfield code="d">Springer US, 1993</subfield><subfield code="g">33(2014), 2 vom: 02. März, Seite 227-252</subfield><subfield code="w">(DE-627)165664401</subfield><subfield code="w">(DE-600)913166-8</subfield><subfield code="w">(DE-576)038480352</subfield><subfield code="x">0926-8782</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:2</subfield><subfield code="g">day:02</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:227-252</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10619-014-7146-x</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">SSG-OPC-BBI</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2014</subfield><subfield code="e">2</subfield><subfield code="b">02</subfield><subfield code="c">03</subfield><subfield code="h">227-252</subfield></datafield></record></collection>
|
| score |
7.399728 |