{"id":"https://openalex.org/W2615048832","doi":"https://doi.org/10.1145/1412331.1412337","title":"Expressiveness and complexity of XML publishing transducers","display_name":"Expressiveness and complexity of XML publishing transducers","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2615048832","doi":"https://doi.org/10.1145/1412331.1412337","mag":"2615048832"},"language":"en","primary_location":{"id":"doi:10.1145/1412331.1412337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412331.1412337","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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 Transactions on Database Systems","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/A5070565287","display_name":"Wenfei Fan","orcid":"https://orcid.org/0000-0001-5149-2656"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["University of Edinburgh and Bell Laboratories, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh and Bell Laboratories, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087587379","display_name":"Floris Geerts","orcid":"https://orcid.org/0000-0002-8967-2473"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Floris Geerts","raw_affiliation_strings":["University of Edinburgh, Scotland, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Scotland, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022264843","display_name":"Frank Neven","orcid":"https://orcid.org/0000-0002-7143-1903"},"institutions":[{"id":"https://openalex.org/I4210127597","display_name":"Transnational University Limburg","ror":"https://ror.org/02xyaf767","country_code":"BE","type":"education","lineage":["https://openalex.org/I4210127597"]},{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Frank Neven","raw_affiliation_strings":["Hasselt University and Transnational University of Limburg, Diepenbeek, Belgium"],"affiliations":[{"raw_affiliation_string":"Hasselt University and Transnational University of Limburg, Diepenbeek, Belgium","institution_ids":["https://openalex.org/I4210127597","https://openalex.org/I878454856"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.7332,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78824057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"4","first_page":"1","last_page":"49"},"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.9994000196456909,"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.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9905999898910522,"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.8769540786743164},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.7418227195739746},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.726952314376831},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5862762928009033},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.5635949373245239},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.5167283415794373},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5080115795135498},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.49551522731781006},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4759642481803894},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.4587642550468445},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4240809679031372},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41856855154037476},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3229841887950897},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.30286911129951477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25129926204681396},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.19772690534591675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08940494060516357}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8769540786743164},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.7418227195739746},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.726952314376831},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5862762928009033},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5635949373245239},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.5167283415794373},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5080115795135498},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.49551522731781006},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4759642481803894},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.4587642550468445},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4240809679031372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41856855154037476},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3229841887950897},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30286911129951477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25129926204681396},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.19772690534591675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08940494060516357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1412331.1412337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412331.1412337","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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 Transactions on Database Systems","raw_type":"journal-article"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/9155","is_oa":false,"landing_page_url":"http://hdl.handle.net/1942/9155","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/2f78eadf-c9c5-48b6-95da-dea0b0c4a15a","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/2f78eadf-c9c5-48b6-95da-dea0b0c4a15a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Geerts, F & Neven, F 2008, 'Expressiveness and complexity of XML publishing transducers', ACM Transactions on Database Systems, vol. 33, no. 4, 25, pp. 1-49. https://doi.org/10.1145/1412331.1412337","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4283820899","display_name":null,"funder_award_id":"GR/S63205/01GR/T27433/01EP/E029213/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7448129778","display_name":null,"funder_award_id":"EP/E029213/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W51516856","https://openalex.org/W174869497","https://openalex.org/W206065626","https://openalex.org/W1482193060","https://openalex.org/W1489366126","https://openalex.org/W1549008998","https://openalex.org/W1554917839","https://openalex.org/W1558832481","https://openalex.org/W1586947774","https://openalex.org/W1816184685","https://openalex.org/W1851620109","https://openalex.org/W1916576906","https://openalex.org/W1969965298","https://openalex.org/W1970599921","https://openalex.org/W1981870753","https://openalex.org/W1989783863","https://openalex.org/W1990483472","https://openalex.org/W1993698725","https://openalex.org/W2012108519","https://openalex.org/W2019940097","https://openalex.org/W2023401000","https://openalex.org/W2028864278","https://openalex.org/W2031639195","https://openalex.org/W2075552472","https://openalex.org/W2091843304","https://openalex.org/W2104236910","https://openalex.org/W2107907225","https://openalex.org/W2109486375","https://openalex.org/W2159668267","https://openalex.org/W2159686758","https://openalex.org/W2173322574","https://openalex.org/W2911295106","https://openalex.org/W2997796892","https://openalex.org/W4211152277","https://openalex.org/W4233228894","https://openalex.org/W6629417139","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W4288363924","https://openalex.org/W2740681086","https://openalex.org/W2258149899","https://openalex.org/W4389096604","https://openalex.org/W2146329061","https://openalex.org/W4387838894","https://openalex.org/W2926816154","https://openalex.org/W3012562581","https://openalex.org/W2165864074","https://openalex.org/W1709921721"],"abstract_inverted_index":{"A":[0],"number":[1],"of":[2,14,26,60,69,84,160,181,198,208],"languages":[3,21,132],"have":[4],"been":[5],"developed":[6],"for":[7,157],"specifying":[8],"XML":[9,18,61,75,130],"publishing,":[10],"that":[11,30,118,189],"is,":[12,119],"transformations":[13],"relational":[15,40,78,90,193],"data":[16],"into":[17],"trees.":[19],"These":[20],"generally":[22],"describe":[23],"the":[24,44,47,55,122,151,178],"behaviors":[25],"a":[27,39,67,82,92,99,142],"middleware":[28],"controller":[29],"builds":[31],"an":[32],"output":[33,123],"tree":[34,45,104,111,214],"iteratively,":[35],"issuing":[36],"queries":[37,91],"to":[38,115,173],"source":[41],"and":[42,57,106,139,146,154,165,184,222],"expanding":[43],"with":[46],"query":[48,194],"results":[49],"at":[50],"each":[51],"step.":[52],"To":[53],"study":[54,81,150],"complexity":[56,202],"expressive":[58,179],"power":[59,180],"publishing":[62,70,85,131,220],"languages,":[63,195],"this":[64],"article":[65],"proposes":[66],"notion":[68],"transducers":[71,86,183,199,221],",":[72],"which":[73],"generate":[74],"trees":[76],"from":[77,121,171],"data.":[79],"We":[80,125,148,162,187],"variety":[83],"based":[87],"on":[88],"what":[89,96],"transducer":[93,100],"can":[94,101,133],"issue,":[95],"temporary":[97],"stores":[98],"use":[102],"during":[103],"generation,":[105,215],"whether":[107],"or":[108,206],"not":[109],"some":[110],"nodes":[112],"are":[113],"allowed":[114],"be":[116,134],"virtual,":[117],"excluded":[120],"tree.":[124],"first":[126],"show":[127,188],"how":[128],"existing":[129,185],"characterized":[135],"by":[136],"such":[137],"transducers,":[138],"thus":[140],"provide":[141],"synergy":[143],"between":[144,219],"theory":[145],"practice.":[147],"then":[149],"membership,":[152],"emptiness,":[153],"equivalence":[155],"problems":[156],"various":[158],"classes":[159,197,203],"transducers.":[161],"establish":[163,217],"lower":[164],"upper":[166],"bounds,":[167],"all":[168],"matching,":[169],"ranging":[170],"PTIME":[172],"undecidable.":[174],"Finally,":[175],"we":[176,216],"investigate":[177],"these":[182],"languages.":[186],"when":[190],"treated":[191],"as":[192],"different":[196],"capture":[200],"either":[201],"(e.g.,":[204,210],"PSPACE)":[205],"fragments":[207],"datalog":[209],"linear":[211],"datalog).":[212],"For":[213],"connections":[218],"logical":[223],"transductions,":[224],"among":[225],"other":[226],"things.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}