{"id":"https://openalex.org/W1990372361","doi":"https://doi.org/10.1145/1989284.1989318","title":"Finding a minimal tree pattern under neighborhood constraints","display_name":"Finding a minimal tree pattern under neighborhood constraints","publication_year":2011,"publication_date":"2011-06-13","ids":{"openalex":"https://openalex.org/W1990372361","doi":"https://doi.org/10.1145/1989284.1989318","mag":"1990372361"},"language":"en","primary_location":{"id":"doi:10.1145/1989284.1989318","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989284.1989318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","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/A5006706357","display_name":"Benny Kimelfeld","orcid":"https://orcid.org/0000-0002-7156-1572"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Benny Kimelfeld","raw_affiliation_strings":["IBM Research - Almaden, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research - Almaden, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014143171","display_name":"Yehoshua Sagiv","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yehoshua Sagiv","raw_affiliation_strings":["The Hebrew University, Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"The Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006706357"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":1.8218,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85395159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"246"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.700508177280426},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6540817022323608},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5454233288764954},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5107572078704834},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.4782387614250183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4764673709869385},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4530763328075409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3838672935962677},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32015591859817505},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2912384867668152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2901308536529541},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.11755916476249695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.700508177280426},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6540817022323608},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5454233288764954},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5107572078704834},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.4782387614250183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4764673709869385},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4530763328075409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3838672935962677},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32015591859817505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2912384867668152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2901308536529541},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.11755916476249695},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1989284.1989318","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989284.1989318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.720.4334","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.720.4334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://benny.net.technion.ac.il/files/2015/02/pods11-patterns1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1570425181","https://openalex.org/W1602283513","https://openalex.org/W1964013848","https://openalex.org/W1980092576","https://openalex.org/W1980392938","https://openalex.org/W1989783863","https://openalex.org/W1990223473","https://openalex.org/W1995451707","https://openalex.org/W1996668544","https://openalex.org/W2024491681","https://openalex.org/W2039313300","https://openalex.org/W2050990892","https://openalex.org/W2067047206","https://openalex.org/W2079694211","https://openalex.org/W2098388305","https://openalex.org/W2105819430","https://openalex.org/W2107105629","https://openalex.org/W2122483056","https://openalex.org/W2132816737","https://openalex.org/W2159454657","https://openalex.org/W2161426837","https://openalex.org/W2169624745","https://openalex.org/W2502590327","https://openalex.org/W2913688336","https://openalex.org/W4292230561","https://openalex.org/W6636108817","https://openalex.org/W6645504594"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W4256429076","https://openalex.org/W2807634898","https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W2001689746"],"abstract_inverted_index":{"Tools":[0],"that":[1,25,131,175,230,236],"automatically":[2],"generate":[3],"queries":[4],"are":[5,9,185],"useful":[6],"when":[7,148],"schemas":[8,184],"hard":[10],"to":[11,14,78,89,112,125,133],"understand":[12],"due":[13],"size":[15],"or":[16,42],"complexity.":[17],"Usually,":[18],"these":[19],"tools":[20],"find":[21,126],"minimal":[22,128],"tree":[23,52,86,129],"patterns":[24],"contain":[26],"a":[27,51,70,73,79,127,138,220],"given":[28,139],"set":[29,161],"(or":[30],"bag)":[31],"of":[32,75,81,83,102,109,116,141,162,172,201,231],"labels.":[33,84,142,196],"The":[34,45,120,226],"labels":[35,55,101,163],"could":[36],"be,":[37],"for":[38,93,154,182,212,235],"example,":[39],"XML":[40],"tags":[41],"relation":[43],"names.":[44],"only":[46],"restriction":[47],"is":[48,66,72,105,118,124,145,164,168,176,205,210,229,240],"that,":[49],"in":[50,107],"pattern,":[53],"adjacent":[54],"must":[56],"be":[57],"among":[58],"some":[59],"specified":[60],"pairs.":[61],"A":[62,85],"more":[63],"expressive":[64],"framework":[65],"developed":[67],"here,":[68],"where":[69,215],"schema":[71,91,135],"mapping":[74],"each":[76],"label":[77,115],"collection":[80],"bags":[82,111],"pattern":[87,130],"conforms":[88,132],"the":[90,97,100,103,110,114,134,150,160,188,213,216],"if":[92],"all":[94],"nodes":[95],"v,":[96],"bag":[98,140],"comprising":[99],"neighbors":[104],"contained":[106],"one":[108,190],"which":[113],"v":[117],"mapped.":[119],"problem":[121,144],"at":[122],"hand":[123],"and":[136,234],"contains":[137],"This":[143],"NP-hard":[146],"even":[147],"using":[149],"simplest":[151],"conceivable":[152],"language":[153,228],"describing":[155],"schemas.":[156],"In":[157,187],"practice,":[158],"however,":[159],"small,":[165],"so":[166],"efficiency":[167],"realized":[169],"by":[170],"means":[171],"an":[173,202,207],"algorithm":[174,209,239],"fixed-parameter":[177],"tractable":[178],"(FPT).":[179],"Two":[180],"languages":[181],"specifying":[183],"discussed.":[186],"first,":[189],"expresses":[191],"pairwise":[192],"mutual":[193,217],"exclusions":[194,218],"between":[195],"Though":[197],"W[1]-hardness":[198],"(hence,":[199],"unlikeliness":[200],"FPT":[203,208,238],"algorithm)":[204],"shown,":[206],"described":[211],"case":[214],"form":[219],"circular-arc":[221],"graph":[222],"(e.g.,":[223],"disjoint":[224],"cliques).":[225],"second":[227],"regular":[232],"expressions,":[233],"another":[237],"described.":[241]},"counts_by_year":[{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}