{"id":"https://openalex.org/W2489919717","doi":"https://doi.org/10.1145/2960414.2960420","title":"Powerful and efficient bulk shortest-path queries","display_name":"Powerful and efficient bulk shortest-path queries","publication_year":2016,"publication_date":"2016-06-24","ids":{"openalex":"https://openalex.org/W2489919717","doi":"https://doi.org/10.1145/2960414.2960420","mag":"2489919717"},"language":"en","primary_location":{"id":"doi:10.1145/2960414.2960420","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2960414.2960420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems","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/A5011851357","display_name":"Peter Rutgers","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Rutgers","raw_affiliation_strings":["VU University Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107092159","display_name":"Claudio Martella","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claudio Martella","raw_affiliation_strings":["VU University Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005110375","display_name":"Spyros Voulgaris","orcid":"https://orcid.org/0000-0003-3023-0299"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Spyros Voulgaris","raw_affiliation_strings":["VU University Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058712681","display_name":"Peter Boncz","orcid":"https://orcid.org/0000-0001-6256-0140"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Boncz","raw_affiliation_strings":["VU University Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"VU University Amsterdam, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011851357"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.334,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65556245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"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.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8510577082633972},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.708952784538269},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6956844329833984},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6056503057479858},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5667411088943481},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5622872710227966},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5449867844581604},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48040011525154114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4756302833557129},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4557454586029053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.452330619096756},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4281453788280487},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.42211562395095825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39105820655822754},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3807693123817444},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06266233325004578},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.053059667348861694}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8510577082633972},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.708952784538269},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6956844329833984},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6056503057479858},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5667411088943481},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5622872710227966},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5449867844581604},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48040011525154114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4756302833557129},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4557454586029053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.452330619096756},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4281453788280487},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.42211562395095825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39105820655822754},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3807693123817444},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06266233325004578},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.053059667348861694},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2960414.2960420","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2960414.2960420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:research.vu.nl:publications/4c8c9c9b-b95a-4376-a43d-9eaa67f7db00","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/citedby.url?scp=84986000872&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400546","display_name":"Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rutgers, P, Martella, C, Voulgaris, S & Boncz, P 2016, Powerful and efficient bulk shortest-path queries: Cypher language extension & Giraph implementation. in ACM International Conference Proceeding Series. vol. 24-June-2016. https://doi.org/10.1145/2960414.2960420","raw_type":"contributionToPeriodical"},{"id":"pmh:vu:oai:research.vu.nl:publications/4c8c9c9b-b95a-4376-a43d-9eaa67f7db00","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/4c8c9c9b-b95a-4376-a43d-9eaa67f7db00","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM International Conference Proceeding Series, 24-June-2016","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1448681276","https://openalex.org/W1589998354","https://openalex.org/W1999545213","https://openalex.org/W2005945380","https://openalex.org/W2019013398","https://openalex.org/W2045271686","https://openalex.org/W2046526098","https://openalex.org/W2057112598","https://openalex.org/W2085494605","https://openalex.org/W2114574859","https://openalex.org/W2150898004","https://openalex.org/W2165681304","https://openalex.org/W2170616854","https://openalex.org/W2296407087"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2133099431","https://openalex.org/W3205592527","https://openalex.org/W2002764510","https://openalex.org/W4293054712","https://openalex.org/W2186738974","https://openalex.org/W1504745067"],"abstract_inverted_index":{"Shortest-path":[0],"computation":[1,37],"is":[2],"central":[3],"to":[4,13,68,83,86],"many":[5],"graph":[6,55],"queries.":[7],"However,":[8],"current":[9],"graph-processing":[10,121],"platforms":[11],"tend":[12],"offer":[14],"limited":[15],"solutions,":[16],"typically":[17],"supporting":[18],"only":[19],"single-source":[20],"and":[21,78,102],"all-pairs":[22],"shortest":[23,63],"path":[24,64,92,100],"algorithms,":[25],"with":[26],"poor":[27],"filtering":[28,97],"options.":[29],"In":[30,66],"this":[31,88,115],"paper":[32],"we":[33,44,105],"address":[34],"the":[35,53,99,111,125,143],"shortest-path":[36],"problem":[38],"in":[39,52,73],"two":[40],"complementary":[41],"directions.":[42],"First,":[43],"introduce":[45],"a":[46,107,120,137],"restrictable,":[47],"top-N":[48,116],"\"bulk\"":[49],"shortest-weighted-paths":[50],"operator":[51,89,117],"Cypher":[54],"query":[56],"language,":[57],"that":[58],"subsumes":[59],"all":[60],"previously":[61],"known":[62],"variants.":[65],"addition":[67],"ease":[69],"of":[70,75,114,139],"use,":[71],"both":[72],"terms":[74],"short":[76],"notation":[77],"more":[79],"robust":[80],"performance":[81],"thanks":[82],"guaranteed":[84],"amenability":[85],"pruning,":[87],"supports":[90],"calculated":[91],"weights,":[93],"as":[94,96],"well":[95],"on":[98,118,124,136],"edges":[101],"vertices.":[103],"Second,":[104],"provide":[106],"scalable":[108],"algorithm":[109],"for":[110],"parallel":[112],"implementation":[113],"Giraph,":[119],"system":[122],"based":[123],"Bulk":[126],"Synchronous":[127],"Parallel":[128],"(BSP)":[129],"model.":[130],"We":[131],"present":[132],"an":[133],"initial":[134],"evaluation":[135],"number":[138],"queries":[140],"executed":[141],"over":[142],"LDBC-SNB":[144],"dataset.":[145]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-08-23T00:00:00"}