{"id":"https://openalex.org/W2951284914","doi":"https://doi.org/10.1145/3327964.3328494","title":"Graph Traversals for Regular Path Queries","display_name":"Graph Traversals for Regular Path Queries","publication_year":2019,"publication_date":"2019-06-19","ids":{"openalex":"https://openalex.org/W2951284914","doi":"https://doi.org/10.1145/3327964.3328494","mag":"2951284914"},"language":"en","primary_location":{"id":"doi:10.1145/3327964.3328494","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3327964.3328494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tud.qucosa.de/id/qucosa%3A86035","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073059932","display_name":"Frank Tetzel","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Tetzel","raw_affiliation_strings":["Database Systems Group, TU Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, TU Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025630883","display_name":"Rom\u0101ns Kasperovi\u010ds","orcid":null},"institutions":[{"id":"https://openalex.org/I4210132444","display_name":"Systems, Applications & Products in Data Processing (Germany)","ror":"https://ror.org/03dsc8d33","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210132444"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Romans Kasperovics","raw_affiliation_strings":["SAP SE, Walldorf, Germany"],"affiliations":[{"raw_affiliation_string":"SAP SE, Walldorf, Germany","institution_ids":["https://openalex.org/I4210132444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063512642","display_name":"Wolfgang Lehner","orcid":"https://orcid.org/0000-0001-8107-2775"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wolfgang Lehner","raw_affiliation_strings":["Database Systems Group, TU Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Database Systems Group, TU Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073059932"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.1857,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54288452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9995999932289124,"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.9973999857902527,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/graph-traversal","display_name":"Graph traversal","score":0.9535240530967712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6926413774490356},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6856066584587097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6123554110527039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5703432559967041},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5598463416099548},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5538090467453003},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5446575880050659},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.43617379665374756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23343423008918762},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16953137516975403},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.166731059551239}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.9535240530967712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6926413774490356},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6856066584587097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6123554110527039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5703432559967041},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5598463416099548},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5538090467453003},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5446575880050659},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.43617379665374756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23343423008918762},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16953137516975403},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.166731059551239}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3327964.3328494","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3327964.3328494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","raw_type":"proceedings-article"},{"id":"pmh:oai:qucosa:de:qucosa:86035","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A86035","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"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":null,"raw_type":"doc-type:Text"}],"best_oa_location":{"id":"pmh:oai:qucosa:de:qucosa:86035","is_oa":true,"landing_page_url":"https://tud.qucosa.de/id/qucosa%3A86035","pdf_url":null,"source":{"id":"https://openalex.org/S4377196312","display_name":"Qucosa (Saxon State and University Library Dresden)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I3132420320","host_organization_name":"SLUB Dresden","host_organization_lineage":["https://openalex.org/I3132420320"],"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":null,"raw_type":"doc-type:Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W2099580433","https://openalex.org/W2493178615","https://openalex.org/W2771362234"],"related_works":["https://openalex.org/W2797291190","https://openalex.org/W2007113317","https://openalex.org/W2887020706","https://openalex.org/W2786956989","https://openalex.org/W1821961669","https://openalex.org/W4230405657","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W1978615272","https://openalex.org/W4319970870"],"abstract_inverted_index":{"Regular":[0],"Path":[1],"Queries":[2],"(RPQs)":[3],"are":[4],"at":[5],"the":[6,18,98],"core":[7],"of":[8,22,54,63],"many":[9],"recent":[10],"declarative":[11],"graph":[12,46,64,72,93],"pattern":[13],"matching":[14,26],"languages.":[15],"They":[16],"leverage":[17],"compactness":[19],"and":[20,78,84,117],"expressiveness":[21],"regular":[23],"expressions":[24],"for":[25,66,92],"recursive":[27],"path":[28],"structures.":[29],"Unfortunately,":[30],"most":[31],"prior":[32],"works":[33],"on":[34],"RPQs":[35,67],"only":[36],"consider":[37],"breadth-first":[38,76],"search":[39,50,77,80],"as":[40,81,101,103],"traversal":[41,73],"strategy,":[42],"neglecting":[43],"other":[44],"possible":[45],"traversals":[47,65,94],"like":[48],"depth-first":[49,79],"or":[51],"a":[52,70,88],"combination":[53],"both.":[55],"Within":[56],"this":[57],"paper,":[58],"we":[59],"conduct":[60],"an":[61],"analysis":[62],"by":[68],"introducing":[69],"generalized":[71],"frame-work":[74],"subsuming":[75],"extreme":[82],"cases":[83],"thus":[85],"opening":[86],"up":[87],"new":[89],"design":[90],"space":[91],"algorithms.":[95],"We":[96],"outline":[97],"underlying":[99],"principles":[100],"well":[102],"provide":[104],"comprehensive":[105],"experimental":[106],"evaluation":[107,115],"using":[108],"implementations":[109],"which":[110],"yield":[111],"beneficial":[112],"results":[113],"regarding":[114],"time":[116],"peak":[118],"memory":[119],"consumption.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}