{"id":"https://openalex.org/W2614693988","doi":"https://doi.org/10.1145/3093754.3093759","title":"Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data","display_name":"Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data","publication_year":2017,"publication_date":"2017-05-12","ids":{"openalex":"https://openalex.org/W2614693988","doi":"https://doi.org/10.1145/3093754.3093759","mag":"2614693988"},"language":"en","primary_location":{"id":"doi:10.1145/3093754.3093759","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3093754.3093759","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"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":"ACM SIGMOD Record","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 Czerwinski","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","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":["Universit\u00e4t Bayreuth"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Bayreuth","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":["Universit\u00e4t Bayreuth"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Bayreuth","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":"Pawel Parys","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","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.6311,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71481768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"46","issue":"1","first_page":"15","last_page":"22"},"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.9993000030517578,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983000159263611,"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.828743577003479},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5846869349479675},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5752890706062317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5248551368713379},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5217833518981934},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5126292109489441},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4998295307159424},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.48305636644363403},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3717353343963623},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32633644342422485},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1976328194141388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1782887578010559},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14224901795387268},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10428819060325623},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06845766305923462}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.828743577003479},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5846869349479675},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5752890706062317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5248551368713379},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5217833518981934},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5126292109489441},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4998295307159424},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.48305636644363403},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3717353343963623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32633644342422485},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1976328194141388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1782887578010559},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14224901795387268},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10428819060325623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06845766305923462}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3093754.3093759","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3093754.3093759","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"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":"ACM SIGMOD Record","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W139189943","https://openalex.org/W203985604","https://openalex.org/W1798915046","https://openalex.org/W1893177189","https://openalex.org/W1969312099","https://openalex.org/W1979514837","https://openalex.org/W1982139456","https://openalex.org/W1983524017","https://openalex.org/W1984218983","https://openalex.org/W1985578047","https://openalex.org/W1994081385","https://openalex.org/W2029824894","https://openalex.org/W2033176822","https://openalex.org/W2045978585","https://openalex.org/W2058208784","https://openalex.org/W2063039776","https://openalex.org/W2068157134","https://openalex.org/W2097244109","https://openalex.org/W2125864420","https://openalex.org/W2132546253","https://openalex.org/W2152890272","https://openalex.org/W2157308304","https://openalex.org/W2164170367","https://openalex.org/W2423871547","https://openalex.org/W2428820896","https://openalex.org/W2532649759","https://openalex.org/W2611196248","https://openalex.org/W2733686445","https://openalex.org/W3100284210","https://openalex.org/W3104723580","https://openalex.org/W6608275464","https://openalex.org/W6679654625","https://openalex.org/W6684308749","https://openalex.org/W6728492374"],"related_works":["https://openalex.org/W2145020325","https://openalex.org/W1559350420","https://openalex.org/W1540916342","https://openalex.org/W2096307634","https://openalex.org/W2072412174","https://openalex.org/W2356601751","https://openalex.org/W956035097","https://openalex.org/W2227684440","https://openalex.org/W2104520711","https://openalex.org/W2343659340"],"abstract_inverted_index":{"Many":[0],"of":[1,39,103],"today's":[2],"graph":[3,9],"query":[4],"languages":[5],"are":[6,23,130,139],"based":[7],"on":[8,116],"pattern":[10,83],"matching.":[11],"We":[12,50],"investigate":[13],"optimization":[14],"for":[15,135],"treeshaped":[16],"patterns":[17,22,42,62,138],"with":[18],"transitive":[19],"closure.":[20],"Such":[21],"quite":[24],"expressive,":[25],"yet":[26],"can":[27,95],"be":[28,64,96],"evaluated":[29],"efficiently.":[30],"The":[31,70,93],"minimization":[32],"problem":[33],"aims":[34],"at":[35],"reducing":[36],"the":[37,47,73,101,113,117,120],"number":[38],"nodes":[40,68],"in":[41,56,144],"and":[43,87],"goes":[44],"back":[45],"to":[46,58,98,142],"early":[48,114],"2000's.":[49],"provide":[51],"an":[52],"example":[53,71,94],"showing":[54],"that,":[55,125],"contrast":[57],"earlier":[59],"claims,":[60],"tree":[61,82,137],"cannot":[63],"minimized":[65],"by":[66],"deleting":[67],"only.":[69],"resolves":[72],"M":[74],"?/=":[75],"NR":[76],"problem,":[77],"which":[78,105],"asks":[79],"if":[80,86,89],"a":[81],"is":[84,91],"minimal":[85],"only":[88],"it":[90],"nonredundant.":[92],"adapted":[97],"also":[99,123,140],"understand":[100],"complexity":[102,128],"minimization,":[104],"was":[106,110],"another":[107],"question":[108],"that":[109],"open":[111],"since":[112],"research":[115],"problem.":[118],"Interestingly,":[119],"latter":[121],"result":[122],"shows":[124],"unless":[126],"standard":[127],"assumptions":[129],"false,":[131],"more":[132],"general":[133],"approaches":[134],"minimizing":[136],"bound":[141],"fail":[143],"some":[145],"cases.":[146]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}