WEKO3
アイテム
{"_buckets": {"deposit": "1e4f0f29-b0ba-436a-85d9-f740cd0e2af4"}, "_deposit": {"id": "48960", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "48960"}, "status": "published"}, "_oai": {"id": "oai:repository.dl.itc.u-tokyo.ac.jp:00048960", "sets": ["15", "96"]}, "item_2_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1999-01-25", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "1", "bibliographicPageEnd": "290", "bibliographicPageStart": "282", "bibliographicVolumeNumber": "E82-D", "bibliographic_titles": [{"bibliographic_title": "IEICE TRANSACTIONS on Information and Systems"}]}]}, "item_2_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "In geographical databases for navigation, users raise various types of queries concerning route guidance. The most fundamental query is a shortest-route query, but, as dynamical traffic information newly becomes available and the static geographical database of roads itself has grown up further, more flexible queries are required to realize a user-friendly interface meeting the current settings. One important query among them is a detour query which provides information about detours, say listing several candidates for useful detours. This paper first reviews algorithms for the shortest and k shortest paths, and discusses their extensions to detour queries. Algorithms for finding a realistic detour are given. The efficiency and property of the algorithms are examined through experiments on an actual road network.", "subitem_description_type": "Abstract"}]}, "item_2_description_6": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "PAPER", "subitem_description_type": "Other"}]}, "item_2_publisher_20": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers"}]}, "item_2_relation_25": {"attribute_name": "関係URI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/", "subitem_relation_type_select": "URI"}}]}, "item_2_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "copyright©1999 IEICE"}]}, "item_2_select_14": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_2_text_4": {"attribute_name": "著者所属", "attribute_value_mlt": [{"subitem_text_value": "IBM Tokyo Research Laboratory"}, {"subitem_text_value": "the Department of Information Science, University of Tokyo"}, {"subitem_text_value": "Sumitomo Electric Industries"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "SHIBUYA, Tetsuo"}], "nameIdentifiers": [{"nameIdentifier": "145486", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "IMAI, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "145487", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "NISHIMURA, Shigeki"}], "nameIdentifiers": [{"nameIdentifier": "145488", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SHIMOURA, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "145489", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "TENMOKU, Kenji"}], "nameIdentifiers": [{"nameIdentifier": "145490", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-12-15"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "Finding Useful Detours in Geographical Databases 1999.pdf", "filesize": [{"value": "531.2 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 531200.0, "url": {"label": "Finding Useful Detours in Geographical Databases 1999.pdf", "url": "https://repository.dl.itc.u-tokyo.ac.jp/record/48960/files/Finding Useful Detours in Geographical Databases 1999.pdf"}, "version_id": "cb4a251d-a03d-4da1-9d3d-87f5fd33e75c"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Finding Useful Detours in Geographical Databases", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Finding Useful Detours in Geographical Databases"}]}, "item_type_id": "2", "owner": "1", "path": ["15", "96"], "permalink_uri": "http://hdl.handle.net/2261/00074085", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-12-14"}, "publish_date": "2017-12-14", "publish_status": "0", "recid": "48960", "relation": {}, "relation_version_is_last": true, "title": ["Finding Useful Detours in Geographical Databases"], "weko_shared_id": null}
Finding Useful Detours in Geographical Databases
http://hdl.handle.net/2261/00074085
http://hdl.handle.net/2261/00074085c23d36a7-845a-49aa-be23-8f29cfc5f2ab
名前 / ファイル | ライセンス | アクション |
---|---|---|
Finding Useful Detours in Geographical Databases 1999.pdf (531.2 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-12-14 | |||||
タイトル | ||||||
タイトル | Finding Useful Detours in Geographical Databases | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
SHIBUYA, Tetsuo
× SHIBUYA, Tetsuo× IMAI, Hiroshi× NISHIMURA, Shigeki× SHIMOURA, Hiroshi× TENMOKU, Kenji |
|||||
著者所属 | ||||||
著者所属 | IBM Tokyo Research Laboratory | |||||
著者所属 | ||||||
著者所属 | the Department of Information Science, University of Tokyo | |||||
著者所属 | ||||||
著者所属 | Sumitomo Electric Industries | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | In geographical databases for navigation, users raise various types of queries concerning route guidance. The most fundamental query is a shortest-route query, but, as dynamical traffic information newly becomes available and the static geographical database of roads itself has grown up further, more flexible queries are required to realize a user-friendly interface meeting the current settings. One important query among them is a detour query which provides information about detours, say listing several candidates for useful detours. This paper first reviews algorithms for the shortest and k shortest paths, and discusses their extensions to detour queries. Algorithms for finding a realistic detour are given. The efficiency and property of the algorithms are examined through experiments on an actual road network. | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | PAPER | |||||
書誌情報 |
IEICE TRANSACTIONS on Information and Systems 巻 E82-D, 号 1, p. 282-290, 発行日 1999-01-25 |
|||||
権利 | ||||||
権利情報 | copyright©1999 IEICE | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | Institute of Electronics, Information and Communication Engineers | |||||
関係URI | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://search.ieice.org/ |