{"id":"https://openalex.org/W2151886642","doi":"https://doi.org/10.1145/1376916.1376952","title":"XPath, transitive closure logic, and nested tree walking automata","display_name":"XPath, transitive closure logic, and nested tree walking automata","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2151886642","doi":"https://doi.org/10.1145/1376916.1376952","mag":"2151886642"},"language":"en","primary_location":{"id":"doi:10.1145/1376916.1376952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376952","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-seventh 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/A5080220262","display_name":"Balder ten Cate","orcid":"https://orcid.org/0000-0002-2538-5846"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Balder ten Cate","raw_affiliation_strings":["Universiteit van Amsterdam, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Universiteit van Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042411667","display_name":"Luc Segoufin","orcid":"https://orcid.org/0000-0002-9564-7581"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Luc Segoufin","raw_affiliation_strings":["INRIA, Cachan, France"],"affiliations":[{"raw_affiliation_string":"INRIA, Cachan, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080220262"],"corresponding_institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":10.6174,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.98124047,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"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/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9970999956130981,"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/transitive-closure","display_name":"Transitive closure","score":0.9323810338973999},{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.9282588958740234},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6947510242462158},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6255712509155273},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5146632790565491},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5075844526290894},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5056793689727783},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.49730566143989563},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.4926953613758087},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.47773072123527527},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4742497503757477},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4607219994068146},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.457827627658844},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.42506420612335205},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4115249216556549},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41055572032928467},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37556734681129456},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3542742431163788},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.3364905118942261},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3295783996582031},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2812339961528778},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2716221213340759},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.2644804120063782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21577680110931396},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09529542922973633},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.0864914059638977}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9323810338973999},{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.9282588958740234},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6947510242462158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6255712509155273},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5146632790565491},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5075844526290894},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5056793689727783},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.49730566143989563},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.4926953613758087},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.47773072123527527},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4742497503757477},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4607219994068146},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.457827627658844},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.42506420612335205},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4115249216556549},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41055572032928467},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37556734681129456},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3542742431163788},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.3364905118942261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3295783996582031},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2812339961528778},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2716221213340759},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.2644804120063782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21577680110931396},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09529542922973633},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.0864914059638977},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1376916.1376952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376952","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-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/995d4930-8f72-4cb2-9454-ca2d6a81a3d2","is_oa":false,"landing_page_url":"http://doi.acm.org/10.1145/1376916.1376952","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ten Cate, B & Segoufin, L 2008, XPath, transitive closure logic, and nested tree walking automata. in M Lenzerini & D Lembo (eds), PODS\u201908: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Vancouver, pp. 251-260, 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (SIGMOD/PODS 2008), Vancouver, Canada, 9/06/08. < http://doi.acm.org/10.1145/1376916.1376952 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/995d4930-8f72-4cb2-9454-ca2d6a81a3d2","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/xpath-transitive-closure-logic-and-nested-tree-walking-automata(995d4930-8f72-4cb2-9454-ca2d6a81a3d2).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ten Cate, B & Segoufin, L 2008, XPath, transitive closure logic, and nested tree walking automata. in M Lenzerini & D Lembo (eds), PODS\u201908: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Vancouver, pp. 251-260, 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (SIGMOD/PODS 2008), Vancouver, Canada, 9/06/08. < http://doi.acm.org/10.1145/1376916.1376952 >","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5899999737739563,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1522193308","https://openalex.org/W1540516609","https://openalex.org/W1547865268","https://openalex.org/W1851620109","https://openalex.org/W1971898721","https://openalex.org/W1978177681","https://openalex.org/W1992552784","https://openalex.org/W2012959900","https://openalex.org/W2015791837","https://openalex.org/W2103146530","https://openalex.org/W2112167310","https://openalex.org/W2116099233","https://openalex.org/W2117789898","https://openalex.org/W2118416409","https://openalex.org/W2126965729","https://openalex.org/W2128710701","https://openalex.org/W2146886516","https://openalex.org/W2151129888","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2160918318","https://openalex.org/W2294034341","https://openalex.org/W2621212289","https://openalex.org/W6631327672","https://openalex.org/W6632975479","https://openalex.org/W7067393679"],"related_works":["https://openalex.org/W1534104849","https://openalex.org/W2136834295","https://openalex.org/W2068852373","https://openalex.org/W2294034341","https://openalex.org/W2044007894","https://openalex.org/W2151886642","https://openalex.org/W2583244020","https://openalex.org/W1538300534","https://openalex.org/W2027602624","https://openalex.org/W2114595770"],"abstract_inverted_index":{"We":[0,40,62,106,115],"consider":[1],"the":[2,11,16,43,74,82,96,109],"navigational":[3],"core":[4],"of":[5,19,46,52,69,100],"XPath,":[6],"extended":[7,57],"with":[8,58],"two":[9],"operators:":[10],"Kleene":[12],"star":[13],"for":[14,111,137,146],"taking":[15],"transitive":[17,60],"closure":[18],"path":[20],"expressions,":[21],"and":[22,102,130],"a":[23,33,38,65],"subtree":[24,35],"relativisation":[25],"operator,":[26],"allowing":[27],"one":[28],"to":[29,32,79],"restrict":[30],"attention":[31],"specific":[34],"while":[36],"evaluating":[37],"subexpression.":[39],"show":[41,80,116],"that":[42,51,81,117,128],"expressive":[44,87,98],"power":[45,99],"this":[47],"XPath":[48,113],"dialect":[49],"equals":[50],"FO(MTC),":[53],"first":[54],"order":[55],"logic":[56],"monadic":[59],"closure.":[61],"also":[63,107],"give":[64],"characterization":[66],"in":[67,122],"terms":[68],"nested":[70],"tree-walking":[71],"automata.":[72],"Using":[73],"latter":[75],"we":[76],"then":[77],"proceed":[78],"language":[83],"is":[84,144],"strictly":[85],"less":[86],"than":[88],"MSO.":[89],"This":[90],"solves":[91],"an":[92],"open":[93],"question":[94],"about":[95],"relative":[97],"FO(MTC)":[101],"MSO":[103],"on":[104],"trees.":[105],"investigate":[108],"complexity":[110],"our":[112,138],"dialect.":[114],"query":[118,131],"evaluation":[119],"be":[120],"done":[121],"polynomial":[123],"time":[124],"(combined":[125],"complexity),":[126],"but":[127],"satisfiability":[129],"containment":[132],"(as":[133],"well":[134],"as":[135],"emptiness":[136],"automaton":[139],"model)":[140],"are":[141],"2ExpTime-complete":[142],"(it":[143],"ExpTime-complete":[145],"Core":[147],"XPath).":[148]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}