{"id":"https://openalex.org/W2128710701","doi":"https://doi.org/10.1145/1142351.1142398","title":"The expressivity of XPath with transitive closure","display_name":"The expressivity of XPath with transitive closure","publication_year":2006,"publication_date":"2006-06-26","ids":{"openalex":"https://openalex.org/W2128710701","doi":"https://doi.org/10.1145/1142351.1142398","mag":"2128710701"},"language":"en","primary_location":{"id":"doi:10.1145/1142351.1142398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142398","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-fifth 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","Universiteit van Amsterdam;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiteit van Amsterdam","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]},{"raw_affiliation_string":"Universiteit van Amsterdam;","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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.2565,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.98134479,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"328","last_page":"337"},"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.9988999962806702,"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.9988999962806702,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.9848828315734863},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.7966421842575073},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.6947025060653687},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6008067727088928},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5987134575843811},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5850203633308411},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5450740456581116},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5131486058235168},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49609240889549255},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.41288498044013977},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.407375305891037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4054972529411316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4024590849876404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3868408203125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3446784019470215},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.27867263555526733},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23140877485275269},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.1786489188671112}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.9848828315734863},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7966421842575073},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.6947025060653687},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6008067727088928},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5987134575843811},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5850203633308411},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5450740456581116},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5131486058235168},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49609240889549255},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.41288498044013977},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.407375305891037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4054972529411316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4024590849876404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3868408203125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3446784019470215},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.27867263555526733},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23140877485275269},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.1786489188671112},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1142351.1142398","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142398","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-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W562932586","https://openalex.org/W1514642181","https://openalex.org/W1524668325","https://openalex.org/W1530792390","https://openalex.org/W1544585257","https://openalex.org/W1558832481","https://openalex.org/W1573061520","https://openalex.org/W1579407214","https://openalex.org/W1583633027","https://openalex.org/W1716100575","https://openalex.org/W1842527871","https://openalex.org/W1993504147","https://openalex.org/W1994536619","https://openalex.org/W2005419964","https://openalex.org/W2012959900","https://openalex.org/W2017759899","https://openalex.org/W2029970296","https://openalex.org/W2069709605","https://openalex.org/W2074385562","https://openalex.org/W2087060113","https://openalex.org/W2107171883","https://openalex.org/W2113885315","https://openalex.org/W2115309483","https://openalex.org/W2117221156","https://openalex.org/W2117522142","https://openalex.org/W2122225808","https://openalex.org/W2124876285","https://openalex.org/W2135415639","https://openalex.org/W2136451095","https://openalex.org/W2149532506","https://openalex.org/W2156267397","https://openalex.org/W2159701549","https://openalex.org/W2160442532","https://openalex.org/W2162904746","https://openalex.org/W2294034341","https://openalex.org/W2689729627","https://openalex.org/W3007065685","https://openalex.org/W3184585588","https://openalex.org/W6631393269"],"related_works":["https://openalex.org/W1534104849","https://openalex.org/W2136834295","https://openalex.org/W2068852373","https://openalex.org/W2124793519","https://openalex.org/W2294034341","https://openalex.org/W2044007894","https://openalex.org/W2151886642","https://openalex.org/W2583244020","https://openalex.org/W1538300534","https://openalex.org/W2027602624"],"abstract_inverted_index":{"We":[0,60],"extend":[1],"Core":[2],"XPath,":[3],"the":[4,65],"navigational":[5],"fragment":[6,67],"of":[7,68,77],"XPath":[8],"1.0,":[9],"with":[10,29,40,80],"transitive":[11,31],"closure":[12,32],"and":[13,58,71],"path":[14,56],"equalities.":[15],"The":[16],"resulting":[17],"language,":[18],"Regular":[19,51,69,78],"XPATH\u2248,":[20,70],"is":[21,53],"expressively":[22],"complete":[23],"for":[24,64,72],"FO*":[25],"(first-order":[26],"logic":[27],"extended":[28],"a":[30,46],"operator":[33],"that":[34,50],"can":[35],"be":[36],"applied":[37],"to":[38],"formulas":[39],"exactly":[41],"two":[42],"free":[43],"variables).":[44],"As":[45],"corollary,":[47],"we":[48],"obtain":[49],"XPATH\u2248":[52,79],"closed":[54],"under":[55],"intersection":[57],"complementation.":[59],"also":[61],"provide":[62],"characterizations":[63],"*-positive":[66],"\u03bcRegular":[73],"XPATH":[74],"(the":[75],"extension":[76],"least":[81],"fixed":[82],"points).":[83]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}