{"id":"https://openalex.org/W4414847994","doi":"https://doi.org/10.46298/lmcs-21(4:2)2025","title":"MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras","display_name":"MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras","publication_year":2025,"publication_date":"2025-10-03","ids":{"openalex":"https://openalex.org/W4414847994","doi":"https://doi.org/10.46298/lmcs-21(4:2)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:2)2025","pdf_url":"https://lmcs.episciences.org/16641/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16641/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012852678","display_name":"Sarah Kleest-Mei\u00dfner","orcid":"https://orcid.org/0000-0002-4133-7975"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sarah Kleest-Mei\u00dfner","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076481141","display_name":"Jonas Marasus","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonas Marasus","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009133355","display_name":"Matthias Niewerth","orcid":"https://orcid.org/0000-0003-2032-5374"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Niewerth","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012852678"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33558263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"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.9972000122070312,"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.9972000122070312,"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.9919000267982483,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/preprocessor","display_name":"Preprocessor","score":0.6759999990463257},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6110000014305115},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.593999981880188},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5249000191688538},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.49939998984336853},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.46209999918937683},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4034000039100647},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.36970001459121704}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6759999990463257},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6110000014305115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100000143051147},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.593999981880188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.550599992275238},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5249000191688538},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38269999623298645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3221000134944916},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29670000076293945},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28200000524520874},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2732999920845032},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:2)2025","pdf_url":"https://lmcs.episciences.org/16641/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:2)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:2)2025","pdf_url":"https://lmcs.episciences.org/16641/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414847994.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,53,79],"describe":[1],"a":[2],"framework":[3,31,60],"for":[4,14,36,41],"maintaining":[5],"forest":[6],"algebra":[7],"representations":[8,18],"that":[9,83],"are":[10,74,125],"of":[11,33,49,58,64,129],"logarithmic":[12],"height":[13],"unranked":[15],"trees.":[16],"Such":[17],"can":[19,104],"be":[20],"computed":[21],"in":[22,27,122,127],"O(n)":[23,86],"time":[24],"and":[25,39,89,109,119],"updated":[26],"O(log(n))":[28,93,115],"time.":[29,116],"The":[30],"is":[32,100],"potential":[34],"interest":[35],"data":[37],"structures":[38],"algorithms":[40,118],"trees":[42,72],"whose":[43],"complexity":[44,120],"depend":[45],"on":[46],"the":[47,50,59,62,98,102,111,123,134],"depth":[48],"tree":[51,99,131],"(representation).":[52],"provide":[54],"an":[55,81,85],"exemplary":[56],"application":[57],"to":[61,68,76],"problem":[63],"efficiently":[65],"enumerating":[66],"answers":[67,91],"MSO-definable":[69],"queries":[70],"over":[71],"which":[73],"subject":[75],"local":[77],"updates.":[78],"exhibit":[80],"algorithm":[82,103],"uses":[84],"preprocessing":[87,108],"phase":[88,113],"enumerates":[90],"with":[92],"delay":[94],"between":[95],"them.":[96],"When":[97],"updated,":[101],"avoid":[105],"repeating":[106],"expensive":[107],"restart":[110],"enumeration":[112],"within":[114],"Our":[117],"results":[121],"paper":[124],"presented":[126],"terms":[128],"node-selecting":[130],"automata":[132],"representing":[133],"MSO":[135],"queries.":[136]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}