{"id":"https://openalex.org/W2124324894","doi":"https://doi.org/10.1145/1559795.1559831","title":"Running tree automata on probabilistic XML","display_name":"Running tree automata on probabilistic XML","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W2124324894","doi":"https://doi.org/10.1145/1559795.1559831","mag":"2124324894"},"language":"en","primary_location":{"id":"doi:10.1145/1559795.1559831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559795.1559831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth 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/A5006348713","display_name":"Sara Cohen","orcid":"https://orcid.org/0000-0002-8482-9435"},"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":true,"raw_author_name":"Sara Cohen","raw_affiliation_strings":["The Hebrew University, Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"The Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006706357","display_name":"Benny Kimelfeld","orcid":"https://orcid.org/0000-0002-7156-1572"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benny Kimelfeld","raw_affiliation_strings":["IBM, San Jose, CA, USA","IBM, San Jose, CA, USA,"],"affiliations":[{"raw_affiliation_string":"IBM, San Jose, CA, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM, San Jose, CA, USA,","institution_ids":["https://openalex.org/I1341412227"]}]},{"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":3,"corresponding_author_ids":["https://openalex.org/A5006348713"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":6.1713,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96726425,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"236"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9983000159263611,"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.749171793460846},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6804584264755249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6480899453163147},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5023276805877686},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4941144287586212},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4836203157901764},{"id":"https://openalex.org/keywords/xml-validation","display_name":"XML validation","score":0.452767014503479},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.44947123527526855},{"id":"https://openalex.org/keywords/xml-schema","display_name":"XML Schema (W3C)","score":0.43572309613227844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20435413718223572},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1411718726158142},{"id":"https://openalex.org/keywords/document-type-definition","display_name":"Document type definition","score":0.14017170667648315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09531956911087036}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.749171793460846},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6804584264755249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6480899453163147},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5023276805877686},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4941144287586212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4836203157901764},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.452767014503479},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.44947123527526855},{"id":"https://openalex.org/C40713593","wikidata":"https://www.wikidata.org/wiki/Q16342","display_name":"XML Schema (W3C)","level":5,"score":0.43572309613227844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20435413718223572},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1411718726158142},{"id":"https://openalex.org/C84314905","wikidata":"https://www.wikidata.org/wiki/Q212327","display_name":"Document type definition","level":4,"score":0.14017170667648315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09531956911087036},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1559795.1559831","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559795.1559831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1508780728","https://openalex.org/W1573219107","https://openalex.org/W1707644991","https://openalex.org/W1970599921","https://openalex.org/W1975501803","https://openalex.org/W1981339597","https://openalex.org/W1988662949","https://openalex.org/W1989783863","https://openalex.org/W1996923081","https://openalex.org/W1998076865","https://openalex.org/W2003250112","https://openalex.org/W2008974204","https://openalex.org/W2022841964","https://openalex.org/W2029764918","https://openalex.org/W2035020702","https://openalex.org/W2061884758","https://openalex.org/W2066585576","https://openalex.org/W2071846104","https://openalex.org/W2073663206","https://openalex.org/W2078686663","https://openalex.org/W2085608749","https://openalex.org/W2121043820","https://openalex.org/W2129450818","https://openalex.org/W2129828874","https://openalex.org/W2133457275","https://openalex.org/W2137092177","https://openalex.org/W2146407749","https://openalex.org/W2156776134","https://openalex.org/W2157813460","https://openalex.org/W2163382775","https://openalex.org/W2165676867","https://openalex.org/W2292993340","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W1600174612","https://openalex.org/W1582302366","https://openalex.org/W56340752","https://openalex.org/W2013920494","https://openalex.org/W2378161351","https://openalex.org/W2591795766","https://openalex.org/W4283736786","https://openalex.org/W2121785123","https://openalex.org/W2376675693","https://openalex.org/W2583209499"],"abstract_inverted_index":{"Tree":[0],"automata":[1],"(specifically,":[2],"bottom-up":[3],"and":[4,12,32,116,140,146],"unranked)":[5],"form":[6],"a":[7,26,39,51,56,70,130],"powerful":[8],"tool":[9],"for":[10,80],"querying":[11],"maintaining":[13],"validity":[14],"of":[15,29,49,108,143,154,163,187],"XML":[16,18,134],"documents.":[17],"with":[19,41],"uncertain":[20],"data":[21,169],"can":[22,174],"be":[23],"modeled":[24],"as":[25],"probability":[27,65,189],"space":[28,34],"labeled":[30],"trees,":[31],"that":[33,66],"is":[35,61,76,87,101],"often":[36],"represented":[37],"by":[38,94],"tree":[40,52,85],"distributional":[42,172],"nodes.":[43],"This":[44,74],"paper":[45,104,159],"investigates":[46],"the":[47,59,64,67,81,84,106,112,141,152,158,161,164,177,185,188],"problem":[48,75],"evaluating":[50],"automaton":[53,68,86],"over":[54],"such":[55],"representation,":[57],"where":[58,83,171],"goal":[60],"to":[62,114,117,129,166,184],"compute":[63],"accepts":[69],"random":[71],"possible":[72],"world.":[73],"generally":[77],"intractable,":[78],"but":[79],"case":[82],"deterministic":[88,95],"(and":[89],"its":[90],"transitions":[91],"are":[92,149],"defined":[93],"string":[96],"automata),":[97],"an":[98,167],"efficient":[99],"algorithm":[100],"presented.":[102],"The":[103],"discusses":[105,160],"applications":[107],"this":[109],"result,":[110],"including":[111],"ability":[113],"sample":[115,176],"evaluate":[118],"queries":[119],"(e.g.,":[120,132],"in":[121,151],"monadic":[122],"second-order":[123],"logic)":[124],"while":[125],"requiring":[126],"a-priori":[127],"conformance":[128],"schema":[131],"DTD).":[133],"schemas":[135],"also":[136],"include":[137],"attribute":[138],"constraints,":[139],"complexity":[142],"key,":[144],"foreign-key":[145],"inclusion":[147],"constraints":[148],"studied":[150],"context":[153],"probabilistic":[155],"XML.":[156],"Finally,":[157],"generalization":[162],"results":[165],"extended":[168],"model,":[170],"nodes":[173],"repeatedly":[175],"same":[178],"subtree,":[179],"thereby":[180],"adding":[181],"another":[182],"exponent":[183],"size":[186],"space.":[190]},"counts_by_year":[{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}