{"id":"https://openalex.org/W2734653958","doi":"https://doi.org/10.1109/access.2017.2725308","title":"Efficient Path Query Processing Through Cloud-Based Mapping Services","display_name":"Efficient Path Query Processing Through Cloud-Based Mapping Services","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2734653958","doi":"https://doi.org/10.1109/access.2017.2725308","mag":"2734653958"},"language":"en","primary_location":{"id":"doi:10.1109/access.2017.2725308","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2725308","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2017.2725308","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021698413","display_name":"Detian Zhang","orcid":"https://orcid.org/0000-0002-9476-0937"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Detian Zhang","raw_affiliation_strings":["School of Digital Media, Jiangnan University, Wuxi, China","ORCiD"],"raw_orcid":"https://orcid.org/0000-0002-9476-0937","affiliations":[{"raw_affiliation_string":"School of Digital Media, Jiangnan University, Wuxi, China","institution_ids":["https://openalex.org/I111599522"]},{"raw_affiliation_string":"ORCiD","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069339294","display_name":"Yuan Liu","orcid":"https://orcid.org/0000-0002-2578-0707"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Liu","raw_affiliation_strings":["School of Digital Media, Jiangnan University, Wuxi, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Digital Media, Jiangnan University, Wuxi, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100340373","display_name":"An Liu","orcid":"https://orcid.org/0000-0002-6368-576X"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"An Liu","raw_affiliation_strings":["School of Computer Science, Soochow University, Suzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006837984","display_name":"Xudong Mao","orcid":"https://orcid.org/0000-0002-1952-4176"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xudong Mao","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100404176","display_name":"Qing Li","orcid":"https://orcid.org/0000-0003-3370-471X"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Qing Li","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.4278,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.90159683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"5","issue":null,"first_page":"12963","last_page":"12973"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8441038131713867},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6001441478729248},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.566260039806366},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5568163990974426},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5065807104110718},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4915638864040375},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4536014795303345},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.4422711431980133},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43667295575141907},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3605114817619324},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.31945469975471497},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.31237369775772095},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.27611830830574036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.260033518075943}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8441038131713867},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6001441478729248},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.566260039806366},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5568163990974426},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5065807104110718},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4915638864040375},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4536014795303345},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.4422711431980133},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43667295575141907},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3605114817619324},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31945469975471497},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.31237369775772095},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.27611830830574036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.260033518075943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/access.2017.2725308","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2725308","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/8e3f5027-5618-4081-933b-470e3e40eba2","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/8e3f5027-5618-4081-933b-470e3e40eba2","pdf_url":"https://scholars.cityu.edu.hk/files/26261140/Efficient_Path_Query_Processing_Through_Cloud_Based_Mapping_Services.pdf","source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ZHANG, D, LIU, Y, LIU, A, MAO, X & LI, Q 2017, 'Efficient Path Query Processing Through Cloud-Based Mapping Services', IEEE Access, vol. 5, pp. 12963-12973. https://doi.org/10.1109/ACCESS.2017.2725308","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:337a7b720ac5431cae8a5541a71a4958","is_oa":true,"landing_page_url":"https://doaj.org/article/337a7b720ac5431cae8a5541a71a4958","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 5, Pp 12963-12973 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2017.2725308","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2017.2725308","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4488393448","display_name":null,"funder_award_id":"61672264","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8420359253","display_name":null,"funder_award_id":"93601539","funder_id":"https://openalex.org/F4320309893","funder_display_name":"City University of Hong Kong"},{"id":"https://openalex.org/G8557935805","display_name":"\u5b89\u5168\u53ef\u4fe1\u7684\u793e\u4f1a\u5316\u670d\u52a1\u63a8\u8350\u7814\u7a76","funder_award_id":"61572336","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320309893","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W183935342","https://openalex.org/W1969483458","https://openalex.org/W1999178951","https://openalex.org/W2019003829","https://openalex.org/W2055523316","https://openalex.org/W2057112598","https://openalex.org/W2065962568","https://openalex.org/W2071974437","https://openalex.org/W2080846005","https://openalex.org/W2081863845","https://openalex.org/W2083019227","https://openalex.org/W2132858787","https://openalex.org/W2140251882","https://openalex.org/W2150175744","https://openalex.org/W2169528473","https://openalex.org/W2170616854","https://openalex.org/W2227557434","https://openalex.org/W2296139022","https://openalex.org/W2470613891","https://openalex.org/W2474823404","https://openalex.org/W2520370992","https://openalex.org/W2570742989","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2556786504","https://openalex.org/W2152149667","https://openalex.org/W4244527061","https://openalex.org/W2469357693","https://openalex.org/W3125756434","https://openalex.org/W1977383094","https://openalex.org/W2572349046","https://openalex.org/W2413368787","https://openalex.org/W1515213763","https://openalex.org/W1779612025"],"abstract_inverted_index":{"Shortest":[0],"path":[1,15,65,80,114,117,145,159,165,207,221,228,245],"queries":[2,229],"have":[3],"been":[4],"widely":[5],"used":[6],"in":[7,110],"location-based":[8],"services":[9,71],"(LBSs).":[10],"To":[11,188,235],"calculate":[12],"the":[13,29,33,63,78,89,99,121,127,136,164,186,211,241,283,286],"shortest":[14,64],"from":[16,82],"an":[17,22,193,218,224,262],"origin":[18,180],"to":[19,27,47,53,68,88,119,196,256,266],"a":[20,168,201,206,248,253],"destination,":[21],"LBS":[23,60,225],"provider":[24,226],"usually":[25],"needs":[26],"know":[28],"map":[30],"data":[31,45,94,278],"of":[32,92,102,123,158,167,220,243,291],"underlying":[34,137],"road":[35,138],"network,":[36],"which":[37],"can":[38,170],"be":[39,48,171],"rather":[40],"costly":[41],"especially":[42],"if":[43,177],"such":[44,72],"need":[46],"kept":[49],"continuously":[50],"and":[51,98,116,126,153,181,251,276,282,289],"up":[52],"date.":[54],"A":[55],"cost-effective":[56],"way":[57],"is":[58,140,162],"that":[59,163],"providers":[61],"outsource":[62],"query":[66,129,146,151,169,175,202],"processing":[67,147],"cloud-based":[69],"mapping":[70,103],"as":[73,247],"Google":[74],"Maps,":[75],"by":[76],"retrieving":[77],"detailed":[79],"information":[81,166],"them":[83],"through":[84,95],"external":[85,96,124],"requests.":[86],"Due":[87],"high":[90],"cost":[91],"accessing":[93],"requests":[97,125],"usage":[100],"limits":[101],"services,":[104],"we":[105,191,238,260],"propose":[106,192],"two":[107],"optimization":[108,161],"techniques":[109],"this":[111,142],"paper,":[112],"namely,":[113],"sharing":[115,160],"caching,":[118,217],"reduce":[120],"number":[122],"user":[128],"response":[130],"time.":[131],"Unlike":[132],"previous":[133],"work":[134],"where":[135],"network":[139],"given,":[141],"paper":[143],"optimizes":[144],"only":[148,208],"based":[149,209,231],"on":[150,185,205,210,232,273],"origins":[152],"destinations.":[154],"The":[155],"basic":[156],"idea":[157],"shared":[172],"with":[173],"another":[174],"q":[176,178],"values":[179],"destination":[182],"both":[183],"lie":[184],"path.":[187],"achieve":[189],"this,":[190,237],"effective":[194,263],"method":[195],"compute":[197],"whether":[198],"or":[199],"not":[200],"origin/destination":[203],"lies":[204],"Euclidean":[212],"distance":[213],"between":[214],"them.":[215],"Path":[216],"extension":[219],"sharing,":[222],"lets":[223],"answer":[227],"directly":[230],"cached":[233],"paths.":[234],"accomplish":[236],"first":[239],"formulate":[240],"problem":[242,250],"constructing":[244],"cache":[246,264,269],"knapsack":[249],"design":[252],"greedy":[254],"algorithm":[255],"solve":[257],"it;":[258],"then,":[259],"devise":[261],"structure":[265],"support":[267],"efficient":[268],"lookup.":[270],"Extensive":[271],"experiments":[272],"Bing":[274],"Maps":[275],"real":[277],"sets":[279],"are":[280],"conducted,":[281],"results":[284],"show":[285],"efficiency,":[287],"scalability,":[288],"applicability":[290],"our":[292],"proposed":[293],"approaches.":[294]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}