Index and query methods in road networks
This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimen...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Feng, Jun [verfasserIn] Watanabe, Toyohide [verfasserIn] |
|---|
| Format: |
E-Book |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
Cham Heidelberg New York Dordrecht London: Springer ; 2015 © 2015 |
|---|
| Schlagwörter: |
Vehicular ad hoc networks (Computer networks) |
|---|
| Systematik: |
|
|---|
| Anmerkung: |
Includes bibliographical references |
|---|---|
| Umfang: |
1 Online-Ressource (xi, 161 Seiten) ; Diagramme, Illustrationen |
| Reproduktion: |
Online-Ausg. |
|---|
| Reihe: |
Smart Innovation, Systems and Technologies ; 29 |
|---|
| Links: | |
|---|---|
| ISBN: |
3-319-10789-5 978-3-319-10789-9 |
| Katalog-ID: |
814753124 |
|---|
| LEADER | 01000cam a22002652 4500 | ||
|---|---|---|---|
| 001 | 814753124 | ||
| 003 | DE-627 | ||
| 005 | 20220808190405.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 150108s2015 sz |||||o 00| ||eng c | ||
| 020 | |a 3319107895 |c electronic bk. |9 3-319-10789-5 | ||
| 020 | |a 9783319107899 |c : electronic bk. |9 978-3-319-10789-9 | ||
| 035 | |a (DE-627)814753124 | ||
| 035 | |a (DE-576)9814753122 | ||
| 035 | |a (DE-599)GBV814753124 | ||
| 035 | |a (EBC)EBC1968259 | ||
| 035 | |a (EBR)ebr10927356 | ||
| 035 | |a (RPAM)MIL766385 | ||
| 035 | |a (EBL)EBL1968259 | ||
| 035 | |a (EBP)031790003 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 044 | |c XA-CH |c XA-DE |c XD-US |c XA-NL |c XA-GB | ||
| 050 | 0 | |a TE228.37 | |
| 082 | 0 | |a 388.312 |2 23 | |
| 084 | |a ZO 4620 |2 rvk |0 (DE-625)rvk/157740: | ||
| 100 | 1 | |a Feng, Jun |e verfasserin |0 (DE-627)1256605832 |0 (DE-576)186605838 |4 aut | |
| 245 | 1 | 0 | |a Index and query methods in road networks |c Jun Feng, Toyohide Watanabe |
| 264 | 1 | |a Cham |a Heidelberg |a New York |a Dordrecht |a London |b Springer |c [2015] | |
| 264 | 4 | |c © 2015 | |
| 300 | |a 1 Online-Ressource (xi, 161 Seiten) |b Diagramme, Illustrationen | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 490 | 0 | |a Smart Innovation, Systems and Technologies |v 29 | |
| 500 | |a Includes bibliographical references | ||
| 505 | 8 | 0 | |a Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree |
| 505 | 8 | 0 | |a 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information |
| 505 | 8 | 0 | |a 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree |
| 505 | 8 | 0 | |a 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis |
| 505 | 8 | 0 | |a 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing |
| 505 | 8 | 0 | |a 5.5 Summary |
| 520 | |a This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc | ||
| 520 | |a This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. | ||
| 533 | |a Online-Ausg. | ||
| 650 | 0 | |a Vehicular ad hoc networks (Computer networks) | |
| 650 | 0 | |a Traffic congestion | |
| 650 | 0 | |a Intelligent transportation systems | |
| 650 | 0 | |a Urban transportation | |
| 650 | 4 | |a Intelligent transportation systems | |
| 650 | 4 | |a Electronic books | |
| 700 | 1 | |a Watanabe, Toyohide |e verfasserin |0 (DE-588)1228481237 |0 (DE-627)1750247550 |4 aut | |
| 776 | 1 | |z 3319107887 | |
| 776 | 1 | |z 9783319107882 | |
| 776 | 0 | 8 | |i Print version |a Index and Query Methods in Road Networks |
| 856 | 4 | 0 | |u http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 |x Verlag |3 Volltext |
| 856 | 4 | 0 | |u https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 |m X:EBC |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-PQE | ||
| 912 | |a GBV_ILN_206 | ||
| 912 | |a ISIL_DE-Brg3 | ||
| 912 | |a SYSFLAG_1 | ||
| 912 | |a GBV_KXP | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a ISIL_DE-1373 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a ISIL_DE-289 | ||
| 936 | r | v | |a ZO 4620 |b Verkehrsleitsysteme, Telematik im Straßenverkehr |k Technik |k Verkehr, Transport |k Straßenverkehr |k Verkehrsleitsysteme, Telematik im Straßenverkehr |0 (DE-627)1271948478 |0 (DE-625)rvk/157740: |0 (DE-576)201948478 |
| 951 | |a BO | ||
| 953 | |2 045F |a 388.312 | ||
| 980 | |2 206 |1 01 |x 3350 |b 1696661706 |c 00 |f --%%-- |d Online-Ressource |e g |j --%%-- |h OLR-EBL |k If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. |y zh |z 26-06-17 | ||
| 980 | |2 370 |1 01 |x 4370 |b 4070810897 |h olr-ebook ebc |k Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. |u i |y z |z 21-02-22 | ||
| 980 | |2 2021 |1 01 |x DE-289 |b 3845732938 |c 00 |f --%%-- |d --%%-- |e --%%-- |j n |y l01 |z 30-01-21 | ||
| 981 | |2 206 |1 01 |x 3350 |y Full Text only for ThHF affiliates |r https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 | ||
| 981 | |2 370 |1 01 |x 4370 |y E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich |r https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 | ||
| 981 | |2 2021 |1 01 |x DE-289 |r https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 | ||
| 995 | |2 206 |1 01 |x 3350 |a OLR-EBL | ||
| 995 | |2 370 |1 01 |x 4370 |a olr-ebook ebc | ||
| 995 | |2 370 |1 01 |x 4370 |a ACQ | ||
| 998 | |2 370 |1 01 |x 4370 |0 2022.02.22 | ||
| author_variant |
j f jf t w tw |
|---|---|
| matchkey_str |
book:9783319107899:2015---- |
| hierarchy_sort_str |
[2015] |
| callnumber-subject-code |
TE |
| publishDate |
2015 |
| allfields |
3319107895 electronic bk. 3-319-10789-5 9783319107899 : electronic bk. 978-3-319-10789-9 (DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 DE-627 ger DE-627 rda eng XA-CH XA-DE XD-US XA-NL XA-GB TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740: Feng, Jun verfasserin (DE-627)1256605832 (DE-576)186605838 aut Index and query methods in road networks Jun Feng, Toyohide Watanabe Cham Heidelberg New York Dordrecht London Springer [2015] © 2015 1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Smart Innovation, Systems and Technologies 29 Includes bibliographical references Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Online-Ausg. Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Intelligent transportation systems Electronic books Watanabe, Toyohide verfasserin (DE-588)1228481237 (DE-627)1750247550 aut 3319107887 9783319107882 Print version Index and Query Methods in Road Networks http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 Verlag Volltext https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 X:EBC Aggregator lizenzpflichtig Volltext ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 ZO 4620 Verkehrsleitsysteme, Telematik im Straßenverkehr Technik Verkehr, Transport Straßenverkehr Verkehrsleitsysteme, Telematik im Straßenverkehr (DE-627)1271948478 (DE-625)rvk/157740: (DE-576)201948478 BO 045F 388.312 206 01 3350 1696661706 00 --%%-- Online-Ressource g --%%-- OLR-EBL If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. zh 26-06-17 370 01 4370 4070810897 olr-ebook ebc Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 21-02-22 2021 01 DE-289 3845732938 00 --%%-- --%%-- --%%-- n l01 30-01-21 206 01 3350 Full Text only for ThHF affiliates https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 2021 01 DE-289 https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 206 01 3350 OLR-EBL 370 01 4370 olr-ebook ebc 370 01 4370 ACQ 370 01 4370 2022.02.22 |
| spelling |
3319107895 electronic bk. 3-319-10789-5 9783319107899 : electronic bk. 978-3-319-10789-9 (DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 DE-627 ger DE-627 rda eng XA-CH XA-DE XD-US XA-NL XA-GB TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740: Feng, Jun verfasserin (DE-627)1256605832 (DE-576)186605838 aut Index and query methods in road networks Jun Feng, Toyohide Watanabe Cham Heidelberg New York Dordrecht London Springer [2015] © 2015 1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Smart Innovation, Systems and Technologies 29 Includes bibliographical references Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Online-Ausg. Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Intelligent transportation systems Electronic books Watanabe, Toyohide verfasserin (DE-588)1228481237 (DE-627)1750247550 aut 3319107887 9783319107882 Print version Index and Query Methods in Road Networks http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 Verlag Volltext https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 X:EBC Aggregator lizenzpflichtig Volltext ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 ZO 4620 Verkehrsleitsysteme, Telematik im Straßenverkehr Technik Verkehr, Transport Straßenverkehr Verkehrsleitsysteme, Telematik im Straßenverkehr (DE-627)1271948478 (DE-625)rvk/157740: (DE-576)201948478 BO 045F 388.312 206 01 3350 1696661706 00 --%%-- Online-Ressource g --%%-- OLR-EBL If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. zh 26-06-17 370 01 4370 4070810897 olr-ebook ebc Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 21-02-22 2021 01 DE-289 3845732938 00 --%%-- --%%-- --%%-- n l01 30-01-21 206 01 3350 Full Text only for ThHF affiliates https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 2021 01 DE-289 https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 206 01 3350 OLR-EBL 370 01 4370 olr-ebook ebc 370 01 4370 ACQ 370 01 4370 2022.02.22 |
| allfields_unstemmed |
3319107895 electronic bk. 3-319-10789-5 9783319107899 : electronic bk. 978-3-319-10789-9 (DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 DE-627 ger DE-627 rda eng XA-CH XA-DE XD-US XA-NL XA-GB TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740: Feng, Jun verfasserin (DE-627)1256605832 (DE-576)186605838 aut Index and query methods in road networks Jun Feng, Toyohide Watanabe Cham Heidelberg New York Dordrecht London Springer [2015] © 2015 1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Smart Innovation, Systems and Technologies 29 Includes bibliographical references Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Online-Ausg. Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Intelligent transportation systems Electronic books Watanabe, Toyohide verfasserin (DE-588)1228481237 (DE-627)1750247550 aut 3319107887 9783319107882 Print version Index and Query Methods in Road Networks http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 Verlag Volltext https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 X:EBC Aggregator lizenzpflichtig Volltext ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 ZO 4620 Verkehrsleitsysteme, Telematik im Straßenverkehr Technik Verkehr, Transport Straßenverkehr Verkehrsleitsysteme, Telematik im Straßenverkehr (DE-627)1271948478 (DE-625)rvk/157740: (DE-576)201948478 BO 045F 388.312 206 01 3350 1696661706 00 --%%-- Online-Ressource g --%%-- OLR-EBL If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. zh 26-06-17 370 01 4370 4070810897 olr-ebook ebc Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 21-02-22 2021 01 DE-289 3845732938 00 --%%-- --%%-- --%%-- n l01 30-01-21 206 01 3350 Full Text only for ThHF affiliates https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 2021 01 DE-289 https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 206 01 3350 OLR-EBL 370 01 4370 olr-ebook ebc 370 01 4370 ACQ 370 01 4370 2022.02.22 |
| allfieldsGer |
3319107895 electronic bk. 3-319-10789-5 9783319107899 : electronic bk. 978-3-319-10789-9 (DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 DE-627 ger DE-627 rda eng XA-CH XA-DE XD-US XA-NL XA-GB TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740: Feng, Jun verfasserin (DE-627)1256605832 (DE-576)186605838 aut Index and query methods in road networks Jun Feng, Toyohide Watanabe Cham Heidelberg New York Dordrecht London Springer [2015] © 2015 1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Smart Innovation, Systems and Technologies 29 Includes bibliographical references Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Online-Ausg. Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Intelligent transportation systems Electronic books Watanabe, Toyohide verfasserin (DE-588)1228481237 (DE-627)1750247550 aut 3319107887 9783319107882 Print version Index and Query Methods in Road Networks http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 Verlag Volltext https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 X:EBC Aggregator lizenzpflichtig Volltext ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 ZO 4620 Verkehrsleitsysteme, Telematik im Straßenverkehr Technik Verkehr, Transport Straßenverkehr Verkehrsleitsysteme, Telematik im Straßenverkehr (DE-627)1271948478 (DE-625)rvk/157740: (DE-576)201948478 BO 045F 388.312 206 01 3350 1696661706 00 --%%-- Online-Ressource g --%%-- OLR-EBL If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. zh 26-06-17 370 01 4370 4070810897 olr-ebook ebc Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 21-02-22 2021 01 DE-289 3845732938 00 --%%-- --%%-- --%%-- n l01 30-01-21 206 01 3350 Full Text only for ThHF affiliates https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 2021 01 DE-289 https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 206 01 3350 OLR-EBL 370 01 4370 olr-ebook ebc 370 01 4370 ACQ 370 01 4370 2022.02.22 |
| allfieldsSound |
3319107895 electronic bk. 3-319-10789-5 9783319107899 : electronic bk. 978-3-319-10789-9 (DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 DE-627 ger DE-627 rda eng XA-CH XA-DE XD-US XA-NL XA-GB TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740: Feng, Jun verfasserin (DE-627)1256605832 (DE-576)186605838 aut Index and query methods in road networks Jun Feng, Toyohide Watanabe Cham Heidelberg New York Dordrecht London Springer [2015] © 2015 1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Smart Innovation, Systems and Technologies 29 Includes bibliographical references Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Online-Ausg. Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Intelligent transportation systems Electronic books Watanabe, Toyohide verfasserin (DE-588)1228481237 (DE-627)1750247550 aut 3319107887 9783319107882 Print version Index and Query Methods in Road Networks http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 Verlag Volltext https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 X:EBC Aggregator lizenzpflichtig Volltext ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 ZO 4620 Verkehrsleitsysteme, Telematik im Straßenverkehr Technik Verkehr, Transport Straßenverkehr Verkehrsleitsysteme, Telematik im Straßenverkehr (DE-627)1271948478 (DE-625)rvk/157740: (DE-576)201948478 BO 045F 388.312 206 01 3350 1696661706 00 --%%-- Online-Ressource g --%%-- OLR-EBL If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. zh 26-06-17 370 01 4370 4070810897 olr-ebook ebc Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. i z 21-02-22 2021 01 DE-289 3845732938 00 --%%-- --%%-- --%%-- n l01 30-01-21 206 01 3350 Full Text only for ThHF affiliates https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259 370 01 4370 E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259 2021 01 DE-289 https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259 206 01 3350 OLR-EBL 370 01 4370 olr-ebook ebc 370 01 4370 ACQ 370 01 4370 2022.02.22 |
| language |
English |
| format_phy_str_mv |
Book |
| building |
206:h 370 2021:0 |
| institution |
findex.gbv.de |
| selectbib_iln_str_mv |
206@h 370@ 2021@01 |
| topic_facet |
Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Electronic books |
| dewey-raw |
388.312 |
| isfreeaccess_bool |
false |
| authorswithroles_txt_mv |
Feng, Jun @@aut@@ Watanabe, Toyohide @@aut@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| dewey-sort |
3388.312 |
| id |
814753124 |
| signature_iln |
206:Online-Ressource 3350:Online-Ressource |
| signature_iln_str_mv |
206:Online-Ressource 3350:Online-Ressource |
| signature_iln_scis_mv |
206:Online-Ressource 3350:Online-Ressource |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000cam a22002652 4500</leader><controlfield tag="001">814753124</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220808190405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150108s2015 sz |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3319107895</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">3-319-10789-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319107899</subfield><subfield code="c">: electronic bk.</subfield><subfield code="9">978-3-319-10789-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)814753124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-576)9814753122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV814753124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBC)EBC1968259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBR)ebr10927356</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(RPAM)MIL766385</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBL)EBL1968259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBP)031790003</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="c">XA-CH</subfield><subfield code="c">XA-DE</subfield><subfield code="c">XD-US</subfield><subfield code="c">XA-NL</subfield><subfield code="c">XA-GB</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TE228.37</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">388.312</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZO 4620</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/157740:</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Jun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-627)1256605832</subfield><subfield code="0">(DE-576)186605838</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Index and query methods in road networks</subfield><subfield code="c">Jun Feng, Toyohide Watanabe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="a">Heidelberg</subfield><subfield code="a">New York</subfield><subfield code="a">Dordrecht</subfield><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 161 Seiten)</subfield><subfield code="b">Diagramme, Illustrationen</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Smart Innovation, Systems and Technologies</subfield><subfield code="v">29</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">5.5 Summary</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Online-Ausg.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Vehicular ad hoc networks (Computer networks)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Traffic congestion</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Intelligent transportation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Urban transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intelligent transportation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic books</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Watanabe, Toyohide</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1228481237</subfield><subfield code="0">(DE-627)1750247550</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">3319107887</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9783319107882</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version</subfield><subfield code="a">Index and Query Methods in Road Networks</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259</subfield><subfield code="m">X:EBC</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-Brg3</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-1373</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-289</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ZO 4620</subfield><subfield code="b">Verkehrsleitsysteme, Telematik im Straßenverkehr</subfield><subfield code="k">Technik</subfield><subfield code="k">Verkehr, Transport</subfield><subfield code="k">Straßenverkehr</subfield><subfield code="k">Verkehrsleitsysteme, Telematik im Straßenverkehr</subfield><subfield code="0">(DE-627)1271948478</subfield><subfield code="0">(DE-625)rvk/157740:</subfield><subfield code="0">(DE-576)201948478</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">388.312</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="b">1696661706</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">Online-Ressource</subfield><subfield code="e">g</subfield><subfield code="j">--%%--</subfield><subfield code="h">OLR-EBL</subfield><subfield code="k">If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible.</subfield><subfield code="y">zh</subfield><subfield code="z">26-06-17</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="b">4070810897</subfield><subfield code="h">olr-ebook ebc</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">21-02-22</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2021</subfield><subfield code="1">01</subfield><subfield code="x">DE-289</subfield><subfield code="b">3845732938</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">--%%--</subfield><subfield code="j">n</subfield><subfield code="y">l01</subfield><subfield code="z">30-01-21</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="y">Full Text only for ThHF affiliates</subfield><subfield code="r">https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="y">E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich</subfield><subfield code="r">https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2021</subfield><subfield code="1">01</subfield><subfield code="x">DE-289</subfield><subfield code="r">https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="a">OLR-EBL</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">olr-ebook ebc</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">ACQ</subfield></datafield><datafield tag="998" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="0">2022.02.22</subfield></datafield></record></collection>
|
| standort_str_mv |
--%%-- |
| callnumber-first |
T - Technology |
| series2 |
Smart Innovation, Systems and Technologies |
| standort_iln_str_mv |
206:--%%-- 3350:--%%-- 2021:--%%-- DE-289:--%%-- |
| author |
Feng, Jun |
| spellingShingle |
Feng, Jun Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary misc TE228.37 ddc 388.312 rvk ZO 4620 misc Vehicular ad hoc networks (Computer networks) misc Traffic congestion misc Intelligent transportation systems misc Urban transportation misc Electronic books Index and query methods in road networks |
| authorStr |
Feng, Jun |
| format |
eBook |
| dewey-ones |
388 - Transportation; ground transportation |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| typewithnormlink_str_mv |
Person@(DE-588)1228481237 DifferentiatedPerson@(DE-588)1228481237 |
| collection |
KXP GVK SWB |
| publishPlace |
Cham Heidelberg New York Dordrecht London |
| remote_str |
true |
| abrufzeichen_iln_str_mv |
206@OLR-EBL 370@olr-ebook ebc 370@ACQ |
| abrufzeichen_iln_scis_mv |
206@OLR-EBL 370@olr-ebook ebc 370@ACQ |
| callnumber-label |
TE228 |
| last_changed_iln_str_mv |
206@26-06-17 370@21-02-22 2021@30-01-21 |
| illustrated |
Not Illustrated |
| contents |
Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree 2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information 3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree 4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis 5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing 5.5 Summary |
| topic_title |
TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740 Index and query methods in road networks Jun Feng, Toyohide Watanabe Vehicular ad hoc networks (Computer networks) Traffic congestion Intelligent transportation systems Urban transportation Electronic books |
| publisher |
Springer |
| publisherStr |
Springer |
| topic |
misc TE228.37 ddc 388.312 rvk ZO 4620 misc Vehicular ad hoc networks (Computer networks) misc Traffic congestion misc Intelligent transportation systems misc Urban transportation misc Electronic books |
| topic_unstemmed |
misc TE228.37 ddc 388.312 rvk ZO 4620 misc Vehicular ad hoc networks (Computer networks) misc Traffic congestion misc Intelligent transportation systems misc Urban transportation misc Electronic books |
| topic_browse |
misc TE228.37 ddc 388.312 rvk ZO 4620 misc Vehicular ad hoc networks (Computer networks) misc Traffic congestion misc Intelligent transportation systems misc Urban transportation misc Electronic books |
| format_facet |
Elektronische Bücher Bücher Elektronische Ressource |
| standort_txtP_mv |
--%%-- |
| format_main_str_mv |
Text Buch |
| carriertype_str_mv |
cr |
| normlinkwithtype_str_mv |
(DE-588)1228481237@Person (DE-588)1228481237@DifferentiatedPerson |
| signature |
Online-Ressource --%%-- |
| signature_str_mv |
Online-Ressource --%%-- |
| dewey-tens |
380 - Commerce, communications & transportation |
| isbn |
3319107895 9783319107899 3319107887 9783319107882 |
| isfreeaccess_txt |
false |
| normlinkwithrole_str_mv |
(DE-588)1228481237@@aut@@ |
| title |
Index and query methods in road networks |
| ctrlnum |
(DE-627)814753124 (DE-576)9814753122 (DE-599)GBV814753124 (EBC)EBC1968259 (EBR)ebr10927356 (RPAM)MIL766385 (EBL)EBL1968259 (EBP)031790003 |
| exemplarkommentar_str_mv |
206@If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible. 370@Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots. |
| title_full |
Index and query methods in road networks Jun Feng, Toyohide Watanabe |
| author_sort |
Feng, Jun |
| callnumber-first-code |
T |
| lang_code |
eng |
| selektneu_str_mv |
370@2022.02.22 |
| isOA_bool |
false |
| dewey-hundreds |
300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| author_browse |
Feng, Jun Watanabe, Toyohide |
| selectkey |
206:z 370:z 2021:l |
| physical |
1 Online-Ressource (xi, 161 Seiten) Diagramme, Illustrationen |
| class |
TE228.37 388.312 23 ZO 4620 rvk (DE-625)rvk/157740 |
| format_se |
Elektronische Bücher |
| countryofpublication_str_mv |
XA-CH XA-DE XD-US XA-NL XA-GB |
| author-letter |
Feng, Jun |
| normlink |
RVK/157740: 1256605832 186605838 1228481237 1750247550 1271948478 201948478 2022.02.22 |
| normlink_prefix_str_mv |
(DE-625)rvk/157740: (DE-627)1256605832 (DE-576)186605838 (DE-588)1228481237 (DE-627)1750247550 (DE-627)1271948478 (DE-576)201948478 2022.02.22 |
| dewey-full |
388.312 |
| author2-role |
verfasserin |
| title_sort |
index and query methods in road networks |
| callnumber |
TE228.37 |
| title_auth |
Index and query methods in road networks |
| abstract |
This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Includes bibliographical references |
| abstractGer |
This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Includes bibliographical references |
| abstract_unstemmed |
This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future. Includes bibliographical references |
| collection_details |
ZDB-30-PQE GBV_ILN_206 ISIL_DE-Brg3 SYSFLAG_1 GBV_KXP GBV_ILN_370 ISIL_DE-1373 GBV_ILN_2021 ISIL_DE-289 |
| title_short |
Index and query methods in road networks |
| url |
http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259 https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259 |
| ausleihindikator_str_mv |
206:g 370 2021:- |
| rolewithnormlink_str_mv |
@@aut@@(DE-588)1228481237 |
| remote_bool |
true |
| author2 |
Watanabe, Toyohide |
| author2Str |
Watanabe, Toyohide |
| callnumber-subject |
TE - Highway Engineering |
| GND_str_mv |
Toyohide Watanabe Watanabe, Toyohide |
| GND_txt_mv |
Toyohide Watanabe Watanabe, Toyohide |
| GND_txtF_mv |
Toyohide Watanabe Watanabe, Toyohide |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| callnumber-a |
TE228.37 |
| up_date |
2024-07-04T17:22:45.746Z |
| _version_ |
1803670012034023424 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000cam a22002652 4500</leader><controlfield tag="001">814753124</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220808190405.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150108s2015 sz |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3319107895</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">3-319-10789-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319107899</subfield><subfield code="c">: electronic bk.</subfield><subfield code="9">978-3-319-10789-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)814753124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-576)9814753122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV814753124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBC)EBC1968259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBR)ebr10927356</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(RPAM)MIL766385</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBL)EBL1968259</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBP)031790003</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="c">XA-CH</subfield><subfield code="c">XA-DE</subfield><subfield code="c">XD-US</subfield><subfield code="c">XA-NL</subfield><subfield code="c">XA-GB</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TE228.37</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">388.312</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZO 4620</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/157740:</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Jun</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-627)1256605832</subfield><subfield code="0">(DE-576)186605838</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Index and query methods in road networks</subfield><subfield code="c">Jun Feng, Toyohide Watanabe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="a">Heidelberg</subfield><subfield code="a">New York</subfield><subfield code="a">Dordrecht</subfield><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 161 Seiten)</subfield><subfield code="b">Diagramme, Illustrationen</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Smart Innovation, Systems and Technologies</subfield><subfield code="v">29</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">Preface; Contents; 1 Introduction; 1.1 Overview; 1.2 Road Network Modeling; 1.2.1 Non-Euclidean Feature of Road Networks; 1.2.2 Multi-levels Road Network; 1.3 Index Techniques in Road Network; 1.4 Query Methods in Road Network; 1.4.1 Precise Query Methods in Road Network; 1.4.2 Aggregate Query Methods in Road Network; 1.5 Cloud for Intelligent Transportation; 1.6 Summary; 2 Index Techniques; 2.1 Binary-Tree Based Index Techniques; 2.1.1 kd-Tree; 2.1.2 K-D-B-Tree; 2.1.3 BSP-Tree; 2.1.4 Matsuyama's kd-Tree; 2.1.5 4d-Tree; 2.1.6 Skd-Tree; 2.2 B-Tree Based Index Techniques; 2.2.1 R-Tree</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">2.2.2 R*-Tree2.2.3 R+-Tree; 2.2.4 Hilbert R-Tree; 2.2.5 P-Tree; 2.3 Quad-Tree Based Structures; 2.3.1 Point Quad-Tree; 2.3.2 MX Quad-Tree; 2.3.3 PR Quad-Tree; 2.3.4 MX-CIF Quad-Tree; 2.4 Cell Methods Based on Dynamic Hashing; 2.4.1 Grid File; 2.4.2 R-File; 2.5 Spatial Objects Ordering; 2.5.1 Z-Order Curve; 2.5.2 Hilbert Curve; 2.6 Summary; 3 Road Network Model; 3.1 Map Information Model; 3.1.1 L-Model and T-Model; 3.1.2 M2 Map Information Model; 3.2 Multi-levels Model for Transportation Network; 3.2.1 Representation of Transportation Information</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">3.2.2 Modeling of Road Network and Traffic Information3.2.3 Representation of Multi-levels of Transportation Network; 3.3 Summary; 4 Index in Road Network; 4.1 R-TPRpm Tree; 4.1.1 Introduction; 4.1.2 Road Connection Algorithms; 4.1.3 Framework and Query Method; 4.1.4 Evaluation; 4.2 MOR-Tree; 4.2.1 Introduction; 4.2.2 Index Structure; 4.2.3 Algorithms for Operations of MOR-Tree; 4.2.4 Indexing Process for Two-Level Road Networks; 4.2.5 Evaluation; 4.3 Sketch RR-Tree; 4.3.1 Sketch and Sketch Index; 4.3.2 RR-Tree for Road Networks; 4.3.3 Structure of Sketch RR-Tree</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">4.3.4 Operations on Sketch RR-Tree4.3.5 Evaluation; 4.4 DynSketch; 4.4.1 Introduction; 4.4.2 Histogram; 4.4.3 Fitting Sketch; 4.4.4 Framework; 4.4.5 Update of Buckets and Road Segments; 4.4.6 Algorithm of Search Using DynSketch; 4.4.7 Evaluation; 4.5 Modified Histogram; 4.5.1 Introduction; 4.5.2 Motivation; 4.5.3 Framework; 4.5.4 Evaluation; 4.6 Summary; 5 Query in Road Network; 5.1 Nearest Neighbor Search on Road Network; 5.1.1 Introduction; 5.1.2 Framework of Cyclic Optimal Multi-step Method; 5.1.3 Cyclic Optimal Multi-step Algorithm; 5.1.4 Algorithm for Theoretical Analysis</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">5.1.5 Evaluation5.2 Continuous Nearest Neighbor Search on Road Network; 5.2.1 Introduction; 5.2.2 Road Network, Route and Computation Point; 5.2.3 Path Search Regions; 5.2.4 CNN-Search Approach; 5.2.5 Algorithm for Large Hierarchical Road Network; 5.2.6 Evaluation; 5.3 Reverse Search Method of CNN; 5.3.1 Introduction; 5.3.2 Temporal Continuous Nearest Neighbor Search; 5.3.3 Algorithm Description; 5.3.4 Evaluation; 5.4 Forecasting Aggregate Query on Road Network; 5.4.1 Introduction; 5.4.2 Exponential Smoothing; 5.4.3 Self-Adaptive Exponential Smoothing; 5.4.4 Transition Exponential Smoothing</subfield></datafield><datafield tag="505" ind1="8" ind2="0"><subfield code="a">5.5 Summary</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index struc</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents the index and query techniques on road network and moving objects which are limited to road network. Here, the road network of non-Euclidean space has its unique characteristics such that two moving objects may be very close in a straight line distance. The index used in two-dimensional Euclidean space is not always appropriate for moving objects on road network. Therefore, the index structure needs to be improved in order to obtain suitable indexing methods, explore the shortest path and acquire nearest neighbor query and aggregation query methods under the new index structures.Chapter 1 of this book introduces the present situation of intelligent traffic and index in road network, Chapter 2 introduces the relevant existing spatial indexing methods. Chapter 3-5 focus on several issues of road network and query, they involves: traffic road network models (see Chapter 3), index structures (see Chapter 4) and aggregate query methods (see Chapter 5). Finally, in Chapter 6, the book briefly describes the applications and the development of intelligent transportation in the future.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Online-Ausg.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Vehicular ad hoc networks (Computer networks)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Traffic congestion</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Intelligent transportation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Urban transportation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intelligent transportation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic books</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Watanabe, Toyohide</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1228481237</subfield><subfield code="0">(DE-627)1750247550</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">3319107887</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9783319107882</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version</subfield><subfield code="a">Index and Query Methods in Road Networks</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://gbv.eblib.com/patron/FullRecord.aspx?p=1968259</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/kxp/detail.action?docID=1968259</subfield><subfield code="m">X:EBC</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-Brg3</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-1373</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-289</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">ZO 4620</subfield><subfield code="b">Verkehrsleitsysteme, Telematik im Straßenverkehr</subfield><subfield code="k">Technik</subfield><subfield code="k">Verkehr, Transport</subfield><subfield code="k">Straßenverkehr</subfield><subfield code="k">Verkehrsleitsysteme, Telematik im Straßenverkehr</subfield><subfield code="0">(DE-627)1271948478</subfield><subfield code="0">(DE-625)rvk/157740:</subfield><subfield code="0">(DE-576)201948478</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">388.312</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="b">1696661706</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">Online-Ressource</subfield><subfield code="e">g</subfield><subfield code="j">--%%--</subfield><subfield code="h">OLR-EBL</subfield><subfield code="k">If you are a ThHF affiliate and the E-Book is not fully accessible, please send us a purchase or short time loan request. All others: Inter-library loans and guest access on campus premises is not possible.</subfield><subfield code="y">zh</subfield><subfield code="z">26-06-17</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="b">4070810897</subfield><subfield code="h">olr-ebook ebc</subfield><subfield code="k">Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden durch Robots.</subfield><subfield code="u">i</subfield><subfield code="y">z</subfield><subfield code="z">21-02-22</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">2021</subfield><subfield code="1">01</subfield><subfield code="x">DE-289</subfield><subfield code="b">3845732938</subfield><subfield code="c">00</subfield><subfield code="f">--%%--</subfield><subfield code="d">--%%--</subfield><subfield code="e">--%%--</subfield><subfield code="j">n</subfield><subfield code="y">l01</subfield><subfield code="z">30-01-21</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="y">Full Text only for ThHF affiliates</subfield><subfield code="r">https://thh-friedensau.idm.oclc.org/login?url=https://ebookcentral.proquest.com/lib/thhfriedensau/detail.action?docID=1968259</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="y">E-Book: Zugriff im HCU-Netz. Zugriff von außerhalb nur für HCU-Angehörige möglich</subfield><subfield code="r">https://ebookcentral.proquest.com/lib/hcuhamburg-ebooks/detail.action?docID=1968259</subfield></datafield><datafield tag="981" ind1=" " ind2=" "><subfield code="2">2021</subfield><subfield code="1">01</subfield><subfield code="x">DE-289</subfield><subfield code="r">https://ebookcentral.proquest.com/lib/kiz-uniulm/detail.action?docID=1968259</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">206</subfield><subfield code="1">01</subfield><subfield code="x">3350</subfield><subfield code="a">OLR-EBL</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">olr-ebook ebc</subfield></datafield><datafield tag="995" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="a">ACQ</subfield></datafield><datafield tag="998" ind1=" " ind2=" "><subfield code="2">370</subfield><subfield code="1">01</subfield><subfield code="x">4370</subfield><subfield code="0">2022.02.22</subfield></datafield></record></collection>
|
| score |
7.3980455 |