{"id":"https://openalex.org/W2981496360","doi":"https://doi.org/10.1134/s036176882008006x","title":"Path Querying on Acyclic Graphs Using Boolean Grammars","display_name":"Path Querying on Acyclic Graphs Using Boolean Grammars","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2981496360","doi":"https://doi.org/10.1134/s036176882008006x","mag":"2981496360"},"language":"en","primary_location":{"id":"doi:10.1134/s036176882008006x","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s036176882008006x","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-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/A5005831641","display_name":"Ekaterina Shemetova","orcid":"https://orcid.org/0000-0002-1577-8347"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"E. N. Shemetova","raw_affiliation_strings":["St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO University), Kronverkskii pr. 49, 197101, St. Petersburg, Russia","St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO University), St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO University), Kronverkskii pr. 49, 197101, St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"St. Petersburg National Research University of Information Technologies, Mechanics, and Optics (ITMO University), St. Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107865756","display_name":"\u0421. \u0412. \u0413\u0440\u0438\u0433\u043e\u0440\u044c\u0435\u0432","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"S. V. Grigorev","raw_affiliation_strings":["St. Petersburg State University, Universitetskaya nab. 7, 199034, St. Petersburg, Russia","St. Petersburg State University, St. Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"St. Petersburg State University, Universitetskaya nab. 7, 199034, St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]},{"raw_affiliation_string":"St. Petersburg State University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005831641"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00388811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"47","issue":"1","first_page":"88","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9968000054359436,"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/T12029","display_name":"DNA and Biological Computing","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6934571266174316},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.5983362793922424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5773894786834717},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4706674814224243},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4595533609390259},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.437553346157074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3796633780002594},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.31354618072509766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.291227251291275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2763004004955292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2404605746269226},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.16330724954605103},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16008412837982178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6934571266174316},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.5983362793922424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5773894786834717},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4706674814224243},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4595533609390259},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.437553346157074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3796633780002594},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.31354618072509766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.291227251291275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2763004004955292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2404605746269226},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.16330724954605103},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16008412837982178}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s036176882008006x","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s036176882008006x","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W41893858","https://openalex.org/W1576925855","https://openalex.org/W1829276407","https://openalex.org/W1893177189","https://openalex.org/W1921622259","https://openalex.org/W1981003078","https://openalex.org/W2011725207","https://openalex.org/W2038073775","https://openalex.org/W2047505657","https://openalex.org/W2059052871","https://openalex.org/W2110833886","https://openalex.org/W2126966221","https://openalex.org/W2135282325","https://openalex.org/W2151871052","https://openalex.org/W2156495052","https://openalex.org/W2285339834","https://openalex.org/W2295466486","https://openalex.org/W2339264483","https://openalex.org/W2534652523","https://openalex.org/W2561266941","https://openalex.org/W2566944396","https://openalex.org/W2806968006","https://openalex.org/W2810731371","https://openalex.org/W2912251669","https://openalex.org/W2916147219","https://openalex.org/W2963770220","https://openalex.org/W2997088857","https://openalex.org/W3100284210","https://openalex.org/W4231429372"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":{"Graph":[0],"data":[1,36],"models":[2],"are":[3,40,199],"widely":[4],"employed":[5],"in":[6,34,152,196],"different":[7],"areas":[8],"of":[9,29,45,54,94,176,193],"computer":[10],"science,":[11],"e.g.,":[12],"graph":[13,35],"databases,":[14],"bioinformatics,":[15],"social":[16],"network":[17],"analysis,":[18],"and":[19,91,112,144,170],"static":[20],"code":[21],"analysis.":[22,37],"Querying":[23],"for":[24,173],"specific":[25],"paths":[26],"is":[27,60,71,84,147],"one":[28],"the":[30,55,92,95,106,110,177,188,191],"main":[31],"problems":[32],"solved":[33],"Path":[38],"queries":[39],"usually":[41],"performed":[42],"by":[43],"means":[44],"a":[46,74,85,102,157],"formal":[47],"grammar":[48],"that":[49,82,128,165],"describes":[50],"admissible":[51],"edge":[52,96],"labeling":[53],"paths.":[56],"A":[57],"path":[58,86,100,134,138,158,178],"query":[59,67,142,168],"said":[61],"to":[62,73,89,132,149,187,201],"be":[63,150],"calculated":[64],"using":[65,140],"relational":[66,141,167],"semantics":[68,143,169],"if":[69],"it":[70],"evaluated":[72],"triple":[75],"(A,":[76],"$${{{v}}_{1}}$$":[77,88],",":[78],"$${{{v}}_{2}}$$":[79,90],")":[80],"such":[81],"there":[83],"from":[87,105],"concatenation":[93],"labels":[97],"along":[98],"this":[99,153,197],"forms":[101],"string":[103],"derivable":[104],"nonterminal":[107],"A.":[108],"With":[109],"regular":[111],"context-free":[113],"languages":[114,127],"having":[115],"limited":[116,200],"expressive":[117,123],"power,":[118],"we":[119,155],"focus":[120],"on":[121,161],"more":[122],"languages,":[124],"namely,":[125],"Boolean":[126,130,145,171],"use":[129],"grammars":[131,146,172],"describe":[133],"labeling.":[135],"Even":[136],"though":[137],"querying":[139,159,179],"known":[148],"undecidable,":[151],"paper,":[154],"propose":[156],"algorithm":[160],"acyclic":[162,202],"directed":[163],"graphs":[164,194],"uses":[166],"approximate":[174],"solution":[175],"problem.":[180],"To":[181],"achieve":[182],"better":[183],"performance":[184],"as":[185],"compared":[186],"naive":[189],"algorithm,":[190],"classes":[192],"considered":[195],"paper":[198],"graphs.":[203]},"counts_by_year":[],"updated_date":"2026-04-02T13:48:15.688549","created_date":"2025-10-10T00:00:00"}