{"id":"https://openalex.org/W1973968359","doi":"https://doi.org/10.1145/1739041.1739084","title":"Probabilistic path queries in road networks","display_name":"Probabilistic path queries in road networks","publication_year":2010,"publication_date":"2010-03-16","ids":{"openalex":"https://openalex.org/W1973968359","doi":"https://doi.org/10.1145/1739041.1739084","mag":"1973968359"},"language":"en","primary_location":{"id":"doi:10.1145/1739041.1739084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1739041.1739084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th International Conference on Extending Database Technology","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102765393","display_name":"Hua Ming","orcid":"https://orcid.org/0000-0001-5379-6311"},"institutions":[{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ming Hua","raw_affiliation_strings":["Facebook Inc., Palo Alto, CA","Facebook, Inc., Palo Alto, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"Facebook Inc., Palo Alto, CA","institution_ids":["https://openalex.org/I4210114444"]},{"raw_affiliation_string":"Facebook, Inc., Palo Alto, CA#TAB#","institution_ids":["https://openalex.org/I4210114444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062247330","display_name":"Jian Pei","orcid":"https://orcid.org/0000-0002-2200-8711"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jian Pei","raw_affiliation_strings":["Simon Fraser University, Burnaby, BC, Canada","[Simon Fraser University Burnaby, BC, Canada]"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"[Simon Fraser University Burnaby, BC, Canada]","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102765393"],"corresponding_institution_ids":["https://openalex.org/I4210114444"],"apc_list":null,"apc_paid":null,"fwci":8.0913,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.98093632,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"358"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9954000115394592,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9925000071525574,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7325518131256104},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6769121289253235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6441702246665955},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6072174310684204},{"id":"https://openalex.org/keywords/statistic","display_name":"Statistic","score":0.42705321311950684},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42494022846221924},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3206561207771301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28739386796951294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2767264246940613},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1611689329147339},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1347579061985016},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09944850206375122},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09326961636543274}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7325518131256104},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6769121289253235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6441702246665955},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6072174310684204},{"id":"https://openalex.org/C89128539","wikidata":"https://www.wikidata.org/wiki/Q1949963","display_name":"Statistic","level":2,"score":0.42705321311950684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42494022846221924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3206561207771301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28739386796951294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2767264246940613},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1611689329147339},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1347579061985016},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09944850206375122},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09326961636543274},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1739041.1739084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1739041.1739084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th International Conference on Extending Database Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1493214567","https://openalex.org/W1497615776","https://openalex.org/W1519770485","https://openalex.org/W1526512085","https://openalex.org/W1528485123","https://openalex.org/W1583434898","https://openalex.org/W1592142404","https://openalex.org/W1968647828","https://openalex.org/W1969483458","https://openalex.org/W1974399255","https://openalex.org/W1976699101","https://openalex.org/W2016049811","https://openalex.org/W2016602956","https://openalex.org/W2017694061","https://openalex.org/W2047152873","https://openalex.org/W2055069594","https://openalex.org/W2058135791","https://openalex.org/W2061496873","https://openalex.org/W2062568266","https://openalex.org/W2064247357","https://openalex.org/W2072526459","https://openalex.org/W2098084730","https://openalex.org/W2100081348","https://openalex.org/W2109821166","https://openalex.org/W2122967662","https://openalex.org/W2154356512","https://openalex.org/W2161455936","https://openalex.org/W2171901130","https://openalex.org/W2767337511","https://openalex.org/W3110115231","https://openalex.org/W4247345418"],"related_works":["https://openalex.org/W2359776416","https://openalex.org/W2353788488","https://openalex.org/W2361916204","https://openalex.org/W2943623134","https://openalex.org/W2372011046","https://openalex.org/W2494523064","https://openalex.org/W2387495973","https://openalex.org/W2215759665","https://openalex.org/W2960358116","https://openalex.org/W2367879005"],"abstract_inverted_index":{"Path":[0],"queries":[1,73,118,218,283],"such":[2,30,47,83],"as":[3,31,84,98],"\"finding":[4],"the":[5,15,32,53,79,85,91,131,137,163,170,173,192,200,243,277,280,285,288],"shortest":[6,194],"path":[7,44,72,117,126,158,187,217,282],"in":[8,20,56,70,74,81],"travel":[9,34,86,140,203],"time":[10,35,87,141,204],"from":[11,133,166,196],"my":[12,134,167,197],"hotel":[13,135,168,198],"to":[14,42,64,136,169,176,199],"airport\"":[16],"are":[17,39,130,162,191],"heavily":[18],"used":[19,41],"many":[21],"applications":[22],"of":[23,93,108,115,150,210,279,287],"road":[24,75,270],"networks.":[25,76],"Currently,":[26],"simple":[27,48],"statistic":[28],"aggregates":[29,49],"average":[33],"between":[36,88],"two":[37,89],"vertices":[38],"often":[40,50],"answer":[43],"queries.":[45],"However,":[46],"cannot":[51],"capture":[52,78],"uncertainty":[54,67,80],"inherent":[55],"traffic.":[57],"In":[58],"this":[59],"paper,":[60],"we":[61,220,241],"study":[62,267],"how":[63],"take":[65,177],"traffic":[66,82],"into":[68],"account":[69],"answering":[71],"To":[77,214],"vertices,":[90],"weight":[92],"an":[94,227],"edge":[95],"is":[96,103,142,205],"modeled":[97],"a":[99,106,124,148,155,184,208,230,236,246,252],"random":[100],"variable":[101],"and":[102,182,235,258,272,284],"approximated":[104],"by":[105,207],"set":[107],"samples.":[109],"We":[110],"propose":[111],"three":[112,222,259],"novel":[113,253],"types":[114],"probabilistic":[116,125,216],"using":[119,268],"basic":[120],"probability":[121,149,209,224],"principles:":[122],"(1)":[123],"query":[127,159,188,289],"like":[128,160,189],"\"what":[129,161,190],"paths":[132,165,195],"airport":[138,171,201],"whose":[139,202],"at":[143,151,178,211],"most":[144,179],"30":[145,180],"minutes":[146],"with":[147,172],"least":[152,212],"90%?\";":[153],"(2)":[154],"weight-threshold":[156],"top-k":[157,186],"top-3":[164,193],"highest":[174],"probabilities":[175],"minutes?\";":[181],"(3)":[183],"probability-threshold":[185],"guaranteed":[206],"90%?\"":[213],"evaluate":[215],"efficiently,":[219],"develop":[221],"efficient":[223],"calculation":[225],"methods:":[226],"exact":[228],"algorithm,":[229,245],"constant":[231],"factor":[232],"approximation":[233],"method":[234,249],"sampling":[237],"based":[238,250],"approach.":[239],"Moreover,":[240],"devise":[242],"P*":[244],"best-first":[247],"search":[248],"on":[251],"hierarchical":[254],"partition":[255],"tree":[256],"index":[257],"effective":[260],"heuristic":[261],"evaluation":[262,290],"functions.":[263],"An":[264],"extensive":[265],"empirical":[266],"real":[269],"networks":[271],"synthetic":[273],"data":[274],"sets":[275],"shows":[276],"effectiveness":[278],"proposed":[281],"efficiency":[286],"methods.":[291]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}