{"id":"https://openalex.org/W2040851932","doi":"https://doi.org/10.1145/1514894.1514917","title":"How big must complete XML query languages be?","display_name":"How big must complete XML query languages be?","publication_year":2009,"publication_date":"2009-03-23","ids":{"openalex":"https://openalex.org/W2040851932","doi":"https://doi.org/10.1145/1514894.1514917","mag":"2040851932"},"language":"en","primary_location":{"id":"doi:10.1145/1514894.1514917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1514894.1514917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1514894.1514917","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1514894.1514917","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105755282","display_name":"Clemens Ley","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Clemens Ley","raw_affiliation_strings":["Oxford University, Oxford, UK","Oxford University, Oxford, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Oxford University, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University, Oxford, UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037774973","display_name":"Michael Benedikt","orcid":"https://orcid.org/0000-0003-2964-0880"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Benedikt","raw_affiliation_strings":["Oxford University, Oxford, UK","Oxford University, Oxford, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Oxford University, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University, Oxford, UK#TAB#","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105755282"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4516,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72894134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"183","last_page":"200"},"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.9991000294685364,"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.9991000294685364,"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.9988999962806702,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.9784666299819946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6963395476341248},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.639959990978241},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.5948432087898254},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5946436524391174},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5542722940444946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5116639137268066},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.492045134305954},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.47633272409439087},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4476347863674164},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4343394637107849},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.425820916891098},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.41145655512809753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37596890330314636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28099656105041504},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1752779483795166},{"id":"https://openalex.org/keywords/xml-database","display_name":"XML database","score":0.1079542338848114}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.9784666299819946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6963395476341248},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.639959990978241},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.5948432087898254},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5946436524391174},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5542722940444946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5116639137268066},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.492045134305954},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.47633272409439087},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4476347863674164},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4343394637107849},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.425820916891098},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.41145655512809753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37596890330314636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28099656105041504},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1752779483795166},{"id":"https://openalex.org/C183068750","wikidata":"https://www.wikidata.org/wiki/Q357393","display_name":"XML database","level":3,"score":0.1079542338848114},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1514894.1514917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1514894.1514917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1514894.1514917","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.6535","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.comlab.ox.ac.uk/files/1856/ley-benedikt-icdt09-update.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.377.1718","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.1718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.edbt.org/Proceedings/2009-StPetersburg/icdt/papers/p0183-Ley.pdf","raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:812e4cf2-ae13-4ca4-b8e7-1484cc258be3","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:812e4cf2-ae13-4ca4-b8e7-1484cc258be3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":{"id":"doi:10.1145/1514894.1514917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1514894.1514917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1514894.1514917","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7246022940","display_name":null,"funder_award_id":"EP/G004021/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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2040851932.pdf","grobid_xml":"https://content.openalex.org/works/W2040851932.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1489366126","https://openalex.org/W1549978238","https://openalex.org/W1573184733","https://openalex.org/W1592493312","https://openalex.org/W1612453857","https://openalex.org/W1684503074","https://openalex.org/W1755189310","https://openalex.org/W1975426586","https://openalex.org/W2044461288","https://openalex.org/W2050398281","https://openalex.org/W2092650892","https://openalex.org/W2095996785","https://openalex.org/W2098171268","https://openalex.org/W2113885315","https://openalex.org/W2132750992","https://openalex.org/W2151686102","https://openalex.org/W2157319504","https://openalex.org/W2160888032","https://openalex.org/W2294034341","https://openalex.org/W4236318182"],"related_works":["https://openalex.org/W1534104849","https://openalex.org/W2136834295","https://openalex.org/W2068852373","https://openalex.org/W2124793519","https://openalex.org/W2146310406","https://openalex.org/W1958678540","https://openalex.org/W2124110813","https://openalex.org/W2294034341","https://openalex.org/W2950897092","https://openalex.org/W1608399088"],"abstract_inverted_index":{"Marx":[0,48],"and":[1,125,169,283,309],"de":[2],"Rijke":[3],"have":[4],"shown":[5,50],"that":[6,22,51,93,106,224,248,292],"the":[7,11,34,75,110,117,163,172,196,312],"navigational":[8,35],"core":[9],"of":[10,57,74,77,109,137,166,174,176,178,198,210,255,269,275,277,314],"w3c":[12],"XML":[13,98],"query":[14,28],"language":[15,143,230],"XPath":[16,41,53,58,294],"is":[17,23,64,87,102,114,186,260,299],"not":[18,300],"first-order":[19,45,95,115],"complete":[20,46,96],"--":[21,54,63],"it":[24,86,148,158,170,287],"cannot":[25],"express":[26],"every":[27],"definable":[29],"in":[30,80,152,187,236,311],"firstorder":[31],"logic":[32,112,140],"over":[33],"predicates.":[36],"How":[37],"can":[38,133,213],"one":[39,132,238],"extend":[40],"to":[42,89,104,251],"get":[43,90],"a":[44,107,130,167,199,204,252,273],"language?":[47],"has":[49,119,144],"Conditional":[52,81,191,293],"an":[55,60,233],"extension":[56],"with":[59,189,295],"\"Until\"":[61],"operator":[62,202,235],"first":[65,263],"order":[66,264],"complete.":[67],"The":[68],"completeness":[69],"argument":[70],"makes":[71],"essential":[72],"use":[73],"presence":[76],"upward":[78],"axes":[79,298],"XPath.":[82],"We":[83,206,222,245],"examine":[84],"whether":[85,208],"possible":[88],"\"forward-only\"":[91],"languages":[92],"are":[94,219],"for":[97,122,262],"Boolean":[99],"queries.":[100],"It":[101],"easy":[103],"see":[105],"variant":[108,118],"temporal":[111,139],"CTL*":[113,229],"complete;":[116,302],"path":[120,131,150],"quantifiers":[121],"downward,":[123],"leftward":[124],"rightward":[126],"paths,":[127],"while":[128],"along":[129,257],"check":[134],"arbitrary":[135,179],"formulas":[136,175,279],"linear":[138],"(LTL).":[141],"This":[142,184],"two":[145],"major":[146],"disadvantages:":[147],"requires":[149,159,171,194],"quantification":[151],"both":[153],"horizontal":[154,239],"directions":[155],"(in":[156],"particular,":[157,286],"looking":[160],"backward":[161],"at":[162],"prior":[164],"siblings":[165],"node),":[168],"consideration":[173],"LTL":[177,256,278],"complexity":[180,276],"on":[181,203],"vertical":[182,258],"paths.":[183],"last":[185],"contrast":[188],"Marx's":[190],"XPath,":[192],"which":[193],"only":[195,237,296],"checking":[197],"single":[200],"Until":[201],"path.":[205],"investigate":[207],"either":[209],"these":[211],"restrictions":[212],"be":[214],"eliminated.":[215],"Our":[216],"main":[217],"results":[218,305],"negative":[220],"ones.":[221],"show":[223,247],"if":[225],"we":[226,242],"restrict":[227],"our":[228,290],"by":[231,281,307],"having":[232],"until":[234],"direction,":[240],"then":[241],"lose":[243],"completeness.":[244,265],"also":[246],"no":[249],"restriction":[250],"\"small\"":[253],"subset":[254],"paths":[259],"sufficient":[261],"Smallness":[266],"here":[267],"means":[268],"bounded":[270],"\"Until":[271],"Depth\",":[272],"measure":[274],"defined":[280],"Etessami":[282],"Wilke.":[284],"In":[285],"follows":[288],"from":[289],"work":[291],"forward":[297],"expressively":[301],"this":[303],"extends":[304],"proved":[306],"Rabinovich":[308],"Maoz":[310],"context":[313],"infinite":[315],"unordered":[316],"trees.":[317]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}