{"id":"https://openalex.org/W2948412143","doi":"https://doi.org/10.1145/3299869.3319882","title":"Efficiently Answering Regular Simple Path Queries on Large Labeled Networks","display_name":"Efficiently Answering Regular Simple Path Queries on Large Labeled Networks","publication_year":2019,"publication_date":"2019-06-18","ids":{"openalex":"https://openalex.org/W2948412143","doi":"https://doi.org/10.1145/3299869.3319882","mag":"2948412143"},"language":"en","primary_location":{"id":"doi:10.1145/3299869.3319882","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3319882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","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/A5053335311","display_name":"Sarisht Wadhwa","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sarisht Wadhwa","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012658175","display_name":"Anagh Prasad","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anagh Prasad","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054697900","display_name":"Sayan Ranu","orcid":"https://orcid.org/0000-0003-4147-9372"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sayan Ranu","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022254797","display_name":"Amitabha Bagchi","orcid":"https://orcid.org/0000-0003-0694-0602"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amitabha Bagchi","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085995102","display_name":"Srikanta Bedathur","orcid":"https://orcid.org/0000-0002-3949-2175"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Srikanta Bedathur","raw_affiliation_strings":["IIT Delhi, New Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIT Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":1.8284,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.88610884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1463","last_page":"1480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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.9957000017166138,"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/computer-science","display_name":"Computer science","score":0.7878910303115845},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6114680767059326},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6031721830368042},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5787222981452942},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5668134689331055},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4899134039878845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47840842604637146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47770312428474426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47138458490371704},{"id":"https://openalex.org/keywords/sparql","display_name":"SPARQL","score":0.4278518855571747},{"id":"https://openalex.org/keywords/rdf","display_name":"RDF","score":0.2115650475025177},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16378724575042725},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.1542263925075531},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0848950445652008}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7878910303115845},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6114680767059326},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6031721830368042},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5787222981452942},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5668134689331055},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4899134039878845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47840842604637146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47770312428474426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47138458490371704},{"id":"https://openalex.org/C41009113","wikidata":"https://www.wikidata.org/wiki/Q54871","display_name":"SPARQL","level":4,"score":0.4278518855571747},{"id":"https://openalex.org/C147497476","wikidata":"https://www.wikidata.org/wiki/Q54872","display_name":"RDF","level":3,"score":0.2115650475025177},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16378724575042725},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1542263925075531},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0848950445652008},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2129575","wikidata":"https://www.wikidata.org/wiki/Q54837","display_name":"Semantic Web","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3299869.3319882","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299869.3319882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W1823866642","https://openalex.org/W1976580206","https://openalex.org/W1976841212","https://openalex.org/W1980622548","https://openalex.org/W2042853248","https://openalex.org/W2059355721","https://openalex.org/W2072607050","https://openalex.org/W2093512350","https://openalex.org/W2101057136","https://openalex.org/W2135282325","https://openalex.org/W2142774324","https://openalex.org/W2153245628","https://openalex.org/W2442049918","https://openalex.org/W2539167637","https://openalex.org/W2573799103","https://openalex.org/W2613189058","https://openalex.org/W2740400026","https://openalex.org/W2792264844","https://openalex.org/W2953301988","https://openalex.org/W2974304695","https://openalex.org/W2989661724","https://openalex.org/W4237974048"],"related_works":["https://openalex.org/W2038821533","https://openalex.org/W2295889387","https://openalex.org/W76044956","https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W129667569","https://openalex.org/W3142934089","https://openalex.org/W2156446763","https://openalex.org/W2011430815","https://openalex.org/W4321606653"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"query":[2,62],"in":[3],"labeled":[4],"graphs":[5],"is":[6,39,82,88,125],"to":[7,148],"determine":[8],"if":[9],"there":[10,90],"exists":[11],"a":[12,15,26,117],"path":[13,24],"between":[14],"given":[16,27],"source":[17],"and":[18,43,74,94],"target":[19],"vertices,":[20],"such":[21,64],"that":[22,84,146],"the":[23,32,44,56],"satisfies":[25],"label":[28,37],"constraint.":[29],"One":[30],"of":[31,35,47,58,70,102,143,160],"powerful":[33],"forms":[34],"specifying":[36],"constraints":[38],"through":[40],"regular":[41,51,103],"expressions,":[42],"resulting":[45],"problem":[46],"reachability":[48,99],"queries":[49,87],"under":[50],"simple":[52],"paths":[53],"(RSP)":[54],"form":[55],"core":[57],"many":[59],"practical":[60,95],"graph":[61,139],"languages":[63],"as":[65,105],"SPARQL":[66],"from":[67],"W3C,":[68],"Cypher":[69],"Neo4J,":[71],"Oracle's":[72],"PGQL":[73],"LDBC's":[75],"G-CORE.":[76],"Despite":[77],"its":[78,131],"importance,":[79],"since":[80],"it":[81],"known":[83],"answering":[85,98],"RSP":[86],"NP-Hard,":[89],"are":[91],"no":[92],"scalable":[93],"solutions":[96],"for":[97],"with":[100,141,156],"full-range":[101],"expressions":[104],"constraints.":[106],"In":[107],"this":[108,112],"paper,":[109],"we":[110],"circumvent":[111],"computational":[113],"bottleneck":[114],"by":[115,127],"designing":[116],"random-walk":[118],"based":[119],"sampling":[120],"algorithm":[121],"called":[122],"ARRIVAL,":[123],"which":[124],"backed":[126],"theoretical":[128],"guarantees":[129],"on":[130,136],"expected":[132],"quality.":[133],"Extensive":[134],"experiments":[135],"billion-sized":[137],"real":[138],"datasets":[140],"thousands":[142],"labels":[144],"show":[145],"ARRIVAL":[147],"be":[149],"100":[150],"times":[151],"faster":[152],"than":[153],"baseline":[154],"strategies":[155],"an":[157],"average":[158],"accuracy":[159],"95%.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}