{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:53:28Z","timestamp":1775638408094,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/icde55515.2023.00132","type":"proceedings-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T17:51:13Z","timestamp":1690393873000},"page":"1678-1690","source":"Crossref","is-referenced-by-count":7,"title":["Reinforcement Learning based Tree Decomposition for Distance Querying in Road Networks"],"prefix":"10.1109","author":[{"given":"Bolong","family":"Zheng","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Ma","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyi","family":"Wan","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongyong","family":"Gao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Huang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology,Hong Kong,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology,Hong Kong,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[{"name":"Aalborg University,Aalborg,Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref34","first-page":"1","article-title":"Treewidth: Characterizations, applications, and computations","volume":"4271","author":"bodlaender","year":"2006","journal-title":"WG"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.14"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"mnih","year":"2015","journal-title":"Nature"},{"key":"ref30","first-page":"144","article-title":"Spatial structure-aware road network embedding via graph contrastive learning","author":"chang","year":"2023","journal-title":"EDBT Open-Proceedings org"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"},{"key":"ref33","article-title":"Graph density","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref32","first-page":"20","article-title":"Mining dense subgraphs with similar edges","volume":"12459","author":"rozenshtein","year":"2020","journal-title":"PKDD"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247614"},{"key":"ref1","first-page":"937","article-title":"Reachability and distance queries via 2-hop labels","author":"cohen","year":"2002","journal-title":"SODA"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00223"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494148"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3459245"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389770"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380579"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407827"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00201"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389703"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407829"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00038"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00065"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00705-1"},{"key":"ref8","article-title":"The rlr-tree: A reinforcement learning based r-tree for spatial data","volume":"abs 2103 4541","author":"gu","year":"2021","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref9","first-page":"568","article-title":"Highway hierarchies hasten exact shortest path queries","volume":"3669","author":"sanders","year":"2005","journal-title":"ESA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref6","first-page":"1","article-title":"Treewidth: characterizations, applications, and computations","author":"bodlaender","year":"2006","journal-title":"International Workshop on Graph-Theoretic Concepts in Computer Science"},{"key":"ref5","first-page":"321","article-title":"Robust exact distance queries on massive networks","author":"delling","year":"2014","journal-title":"Microsoft Research"}],"event":{"name":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","location":"Anaheim, CA, USA","start":{"date-parts":[[2023,4,3]]},"end":{"date-parts":[[2023,4,7]]}},"container-title":["2023 IEEE 39th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10184508\/10184509\/10184582.pdf?arnumber=10184582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T17:37:26Z","timestamp":1692034646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10184582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icde55515.2023.00132","relation":{},"subject":[],"published":{"date-parts":[[2023,4]]}}}