{"id":"https://openalex.org/W3194856827","doi":"https://doi.org/10.1145/3468791.3468844","title":"Online Landmark-Based Batch Processing of Shortest Path Queries","display_name":"Online Landmark-Based Batch Processing of Shortest Path Queries","publication_year":2021,"publication_date":"2021-07-06","ids":{"openalex":"https://openalex.org/W3194856827","doi":"https://doi.org/10.1145/3468791.3468844","mag":"3194856827"},"language":"en","primary_location":{"id":"doi:10.1145/3468791.3468844","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3468791.3468844","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3468791.3468844","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"33rd International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3468791.3468844","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032754500","display_name":"Manuel Hotz","orcid":null},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Manuel Hotz","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000400301","display_name":"Theodoros Chondrogiannis","orcid":"https://orcid.org/0000-0002-9623-9133"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Theodoros Chondrogiannis","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028355735","display_name":"Leonard W\u00f6rteler","orcid":"https://orcid.org/0009-0003-0532-0505"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Leonard W\u00f6rteler","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000695235","display_name":"Michael Grossniklaus","orcid":"https://orcid.org/0000-0003-1609-2221"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Grossniklaus","raw_affiliation_strings":["University of Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189712700"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"144"},"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.9973000288009644,"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.9922000169754028,"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.8015291094779968},{"id":"https://openalex.org/keywords/landmark","display_name":"Landmark","score":0.749366044998169},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.744256854057312},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.7239426970481873},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6197196245193481},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6191864013671875},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4929625988006592},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48263412714004517},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46932026743888855},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.4534660577774048},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37165072560310364},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.35378938913345337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31482332944869995},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2936694920063019},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13802140951156616}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8015291094779968},{"id":"https://openalex.org/C2780297707","wikidata":"https://www.wikidata.org/wiki/Q4895393","display_name":"Landmark","level":2,"score":0.749366044998169},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.744256854057312},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.7239426970481873},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6197196245193481},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6191864013671875},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4929625988006592},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48263412714004517},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46932026743888855},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.4534660577774048},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37165072560310364},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.35378938913345337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31482332944869995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2936694920063019},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13802140951156616},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3468791.3468844","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3468791.3468844","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3468791.3468844","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"33rd International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/54785","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-dlxcombd5sa19","pdf_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-dlxcombd5sa19","source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"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":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3468791.3468844","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3468791.3468844","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3468791.3468844","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"33rd International Conference on Scientific and Statistical Database Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2714815206","display_name":null,"funder_award_id":"CH 2464/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3770364687","display_name":null,"funder_award_id":"CH 2464/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8630688669","display_name":null,"funder_award_id":"2464/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3194856827.pdf","grobid_xml":"https://content.openalex.org/works/W3194856827.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W68380453","https://openalex.org/W172963486","https://openalex.org/W1493214567","https://openalex.org/W1504126076","https://openalex.org/W1597203970","https://openalex.org/W1810931192","https://openalex.org/W1969483458","https://openalex.org/W1979075286","https://openalex.org/W2014889099","https://openalex.org/W2019003829","https://openalex.org/W2065962568","https://openalex.org/W2070232376","https://openalex.org/W2101778955","https://openalex.org/W2102842495","https://openalex.org/W2104317982","https://openalex.org/W2134874858","https://openalex.org/W2148831787","https://openalex.org/W2151400766","https://openalex.org/W2167081989","https://openalex.org/W2169528473","https://openalex.org/W2171901130","https://openalex.org/W2172107427","https://openalex.org/W2487614805","https://openalex.org/W2563654217","https://openalex.org/W2755088640","https://openalex.org/W2912492336","https://openalex.org/W2952276741","https://openalex.org/W2962938151","https://openalex.org/W2967996808","https://openalex.org/W3009233884","https://openalex.org/W3027461786","https://openalex.org/W3032255305","https://openalex.org/W3104469712","https://openalex.org/W4300631623"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Processing":[0],"shortest":[1,29,92],"path":[2,30],"queries":[3,94],"is":[4],"a":[5,27,135],"basic":[6],"operation":[7],"in":[8,49,63,141],"many":[9],"graph":[10],"problems.":[11],"Both":[12],"preprocessing-based":[13],"and":[14,71,85,131],"batch":[15,90],"processing":[16,91],"techniques":[17,45,88,121],"have":[18],"been":[19],"proposed":[20],"to":[21,56,61],"speed":[22],"up":[23],"the":[24,52,64,67,107,123,126],"computation":[25,108],"of":[26,37,109,125,138],"single":[28],"by":[31,105],"amortizing":[32],"its":[33],"costs.":[34],"However,":[35],"both":[36,83,129],"these":[38],"approaches":[39],"suffer":[40],"from":[41],"limitations.":[42],"The":[43],"former":[44],"are":[46],"prohibitively":[47],"expensive":[48],"situations":[50],"where":[51],"precomputed":[53],"information":[54],"needs":[55],"be":[57,73,102],"updated":[58],"frequently":[59],"due":[60],"changes":[62],"graph,":[65],"while":[66],"latter":[68],"require":[69],"coordinates":[70],"cannot":[72],"used":[74],"on":[75,128],"non-spatial":[76,132],"graphs.":[77],"In":[78],"this":[79],"paper,":[80],"we":[81],"address":[82],"limitations":[84],"propose":[86],"novel":[87],"for":[89],"paths":[93],"using":[95],"landmarks.":[96],"We":[97],"show":[98],"how":[99],"preprocessing":[100],"can":[101],"avoided":[103],"entirely":[104],"integrating":[106],"landmark":[110],"distances":[111],"into":[112],"query":[113],"processing.":[114],"Our":[115],"experimental":[116],"results":[117],"demonstrate":[118],"that":[119],"our":[120],"outperform":[122],"state":[124],"art":[127],"spatial":[130],"graphs":[133],"with":[134],"maximum":[136],"speedup":[137],"3.61":[139],"\u00d7":[140],"online":[142],"scenarios.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}