{"id":"https://openalex.org/W2884065321","doi":"https://doi.org/10.1145/3180281","title":"Minimization of Tree Patterns","display_name":"Minimization of Tree Patterns","publication_year":2018,"publication_date":"2018-07-25","ids":{"openalex":"https://openalex.org/W2884065321","doi":"https://doi.org/10.1145/3180281","mag":"2884065321"},"language":"en","primary_location":{"id":"doi:10.1145/3180281","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3180281","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5113969130","display_name":"Wojciech Czerwi\u0144ski","orcid":"https://orcid.org/0000-0002-6169-868X"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Czerwi\u0143ski","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016412428","display_name":"Wim Martens","orcid":"https://orcid.org/0000-0001-9480-3522"},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wim Martens","raw_affiliation_strings":["University of Bayreuth, Bayreuth, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bayreuth, Bayreuth, Germany","institution_ids":["https://openalex.org/I54009628"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009133355","display_name":"Matthias Niewerth","orcid":"https://orcid.org/0000-0003-2032-5374"},"institutions":[{"id":"https://openalex.org/I54009628","display_name":"University of Bayreuth","ror":"https://ror.org/0234wmv40","country_code":"DE","type":"education","lineage":["https://openalex.org/I54009628"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Niewerth","raw_affiliation_strings":["University of Bayreuth, Bayreuth, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bayreuth, Bayreuth, Germany","institution_ids":["https://openalex.org/I54009628"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085631393","display_name":"Pawe\u0142 Parys","orcid":"https://orcid.org/0000-0001-7247-1408"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Parys","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9477,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78090709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"65","issue":"4","first_page":"1","last_page":"46"},"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.9997000098228455,"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.9997000098228455,"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.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.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6432542204856873},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5923516154289246},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.582525372505188},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5730469226837158},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5615367293357849},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47844958305358887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47024741768836975},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4554750919342041},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.44757065176963806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4218376576900482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3762815296649933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.364181786775589},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3566133975982666},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17143934965133667},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14920929074287415},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.0764646828174591}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6432542204856873},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5923516154289246},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.582525372505188},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5730469226837158},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5615367293357849},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47844958305358887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47024741768836975},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4554750919342041},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.44757065176963806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4218376576900482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3762815296649933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.364181786775589},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3566133975982666},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17143934965133667},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14920929074287415},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.0764646828174591},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3180281","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3180281","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1173992668","display_name":null,"funder_award_id":"4938/2-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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W139189943","https://openalex.org/W203985604","https://openalex.org/W1515993376","https://openalex.org/W1798915046","https://openalex.org/W1893177189","https://openalex.org/W1969312099","https://openalex.org/W1979514837","https://openalex.org/W1982139456","https://openalex.org/W1983510271","https://openalex.org/W1983524017","https://openalex.org/W1984218983","https://openalex.org/W1994081385","https://openalex.org/W2029824894","https://openalex.org/W2033176822","https://openalex.org/W2039177735","https://openalex.org/W2045978585","https://openalex.org/W2058208784","https://openalex.org/W2063039776","https://openalex.org/W2065251436","https://openalex.org/W2068157134","https://openalex.org/W2096729377","https://openalex.org/W2097244109","https://openalex.org/W2110249090","https://openalex.org/W2125864420","https://openalex.org/W2132546253","https://openalex.org/W2146886516","https://openalex.org/W2147973254","https://openalex.org/W2157308304","https://openalex.org/W2164170367","https://openalex.org/W2411138143","https://openalex.org/W2423871547","https://openalex.org/W2428820896","https://openalex.org/W2532649759","https://openalex.org/W2556970231","https://openalex.org/W2733686445","https://openalex.org/W2737168042","https://openalex.org/W2953301988","https://openalex.org/W3100284210","https://openalex.org/W3104723580"],"related_works":["https://openalex.org/W1559350420","https://openalex.org/W2227684440","https://openalex.org/W1529499406","https://openalex.org/W2150988524","https://openalex.org/W2359095153","https://openalex.org/W2156833871","https://openalex.org/W2566588687","https://openalex.org/W2092152400","https://openalex.org/W2083751087","https://openalex.org/W1521720839"],"abstract_inverted_index":{"Many":[0],"of":[1,15,31,62],"today\u2019s":[2],"graph":[3,9,32],"query":[4],"languages":[5],"are":[6,164],"based":[7],"on":[8,142],"pattern":[10,107],"matching.":[11],"We":[12,73],"investigate":[13],"optimization":[14],"tree-shaped":[16],"patterns":[17,24,65,85,163],"that":[18,124,135],"have":[19],"transitive":[20],"closure":[21],"operators.":[22],"Such":[23],"not":[25],"only":[26,112],"appear":[27],"in":[28,64,79,169],"the":[29,60,70,96,139,143],"context":[30],"databases":[33],"but":[34],"also":[35,165],"were":[36],"originally":[37],"studied":[38],"for":[39,160],"querying":[40],"tree-structured":[41],"data,":[42],"where":[43],"they":[44],"can":[45,119],"perform":[46],"child,":[47],"descendant,":[48],"node":[49],"label,":[50],"and":[51,66,111],"wildcard":[52],"tests.":[53],"The":[54,93,117,145],"minimization":[55,125],"problem":[56],"aims":[57],"at":[58],"reducing":[59],"number":[61],"nodes":[63,91],"goes":[67],"back":[68],"to":[69,81,122,167],"early":[71,140],"2000s.":[72],"provide":[74],"an":[75],"example":[76,94,118],"showing":[77],"that,":[78,149],"contrast":[80],"earlier":[82],"claims,":[83],"tree":[84,106,162],"cannot":[86],"be":[87,120],"minimized":[88],"by":[89],"deleting":[90],"only.":[92],"resolves":[95,132],"M":[97],"=":[98,152],"?":[99],"NR":[100],"problem,":[101],"which":[102,131],"asks":[103],"if":[104,110,113],"a":[105],"is":[108,115,126],"minimal":[109],"it":[114],"nonredundant.":[116],"adapted":[121],"prove":[123],"\u03a3":[127],"P":[128,154],"2":[129,155],"-complete,":[130],"another":[133],"question":[134],"was":[136],"open":[137],"since":[138],"research":[141],"problem.":[144],"latter":[146],"result":[147],"shows":[148],"unless":[150],"NP":[151],"\u03a0":[153],",":[156],"more":[157],"general":[158],"approaches":[159],"minimizing":[161],"bound":[166],"fail":[168],"general.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}