{"id":"https://openalex.org/W2739438537","doi":"https://doi.org/10.1145/3102254.3102264","title":"Efficient top-k shortest path query processing in sparse graph databases","display_name":"Efficient top-k shortest path query processing in sparse graph databases","publication_year":2017,"publication_date":"2017-06-19","ids":{"openalex":"https://openalex.org/W2739438537","doi":"https://doi.org/10.1145/3102254.3102264","mag":"2739438537"},"language":"en","primary_location":{"id":"doi:10.1145/3102254.3102264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3102254.3102264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","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/A5030091324","display_name":"Hasan M. Jamil","orcid":"https://orcid.org/0000-0002-3124-3780"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hasan M. Jamil","raw_affiliation_strings":["University of Idaho"],"affiliations":[{"raw_affiliation_string":"University of Idaho","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030091324"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09503261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9976000189781189,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8870047330856323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7374604940414429},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6760355234146118},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.566068172454834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5568535923957825},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44799086451530457},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4183093309402466},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41185128688812256},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.32444649934768677},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15100687742233276},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08168691396713257}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8870047330856323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7374604940414429},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6760355234146118},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.566068172454834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5568535923957825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44799086451530457},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4183093309402466},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41185128688812256},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.32444649934768677},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15100687742233276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08168691396713257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3102254.3102264","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3102254.3102264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G421371959","display_name":null,"funder_award_id":"IIS 0612203 and DRL 1515550","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W746304152","https://openalex.org/W1421378112","https://openalex.org/W1504891601","https://openalex.org/W1507039213","https://openalex.org/W1924589908","https://openalex.org/W1968401677","https://openalex.org/W1968840325","https://openalex.org/W1979729479","https://openalex.org/W1999141286","https://openalex.org/W2001099532","https://openalex.org/W2010402726","https://openalex.org/W2011282943","https://openalex.org/W2013973777","https://openalex.org/W2017532337","https://openalex.org/W2020366993","https://openalex.org/W2035173902","https://openalex.org/W2036032098","https://openalex.org/W2051382614","https://openalex.org/W2052120747","https://openalex.org/W2072485026","https://openalex.org/W2073570452","https://openalex.org/W2076109400","https://openalex.org/W2078948975","https://openalex.org/W2083235381","https://openalex.org/W2089845007","https://openalex.org/W2094569404","https://openalex.org/W2098832925","https://openalex.org/W2099083325","https://openalex.org/W2102563702","https://openalex.org/W2109309764","https://openalex.org/W2118212234","https://openalex.org/W2123781167","https://openalex.org/W2128601422","https://openalex.org/W2131058166","https://openalex.org/W2134729426","https://openalex.org/W2139679521","https://openalex.org/W2144050074","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2259421383","https://openalex.org/W2295788176","https://openalex.org/W2311473635","https://openalex.org/W2354770748","https://openalex.org/W2406635233","https://openalex.org/W2464477051","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2128644323","https://openalex.org/W2563374863","https://openalex.org/W1499514251","https://openalex.org/W2625266575","https://openalex.org/W1493606949","https://openalex.org/W2098564749","https://openalex.org/W2061643569","https://openalex.org/W2949147445","https://openalex.org/W1987125980","https://openalex.org/W4298440031"],"abstract_inverted_index":{"While":[0],"internet":[1],"graphs":[2,20],"are":[3,11,30,43,61,67],"usually":[4],"dense":[5],"as":[6],"a":[7,44],"whole,":[8],"localized":[9],"sub-graphs":[10],"often":[12],"sparse.":[13],"In":[14,46],"particular,":[15],"in":[16],"social":[17,38],"networks,":[18],"the":[19,36],"corresponding":[21],"to":[22,35],"users'":[23],"friends,":[24],"connections":[25],"and":[26],"interactions":[27],"with":[28],"others":[29],"almost":[31],"always":[32],"sparse":[33,48],"relative":[34],"entire":[37],"graph":[39],"of":[40],"which":[41],"they":[42],"part.":[45],"such":[47,72],"graphs,":[49],"reachability":[50,59],"queries":[51,66],"may":[52],"suffer":[53],"unnecessary":[54],"performance":[55],"losses":[56],"if":[57],"generalized":[58],"algorithms":[60],"used.":[62],"Classical":[63],"shortest":[64],"path":[65],"among":[68],"those":[69],"that":[70],"incur":[71],"losses.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}