{"id":"https://openalex.org/W2154983498","doi":"https://doi.org/10.1145/1265530.1265552","title":"The complexity of reasoning about pattern-based XML schemas","display_name":"The complexity of reasoning about pattern-based XML schemas","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2154983498","doi":"https://doi.org/10.1145/1265530.1265552","mag":"2154983498"},"language":"en","primary_location":{"id":"doi:10.1145/1265530.1265552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265552","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-sixth 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/A5024434748","display_name":"Gjergji Kasneci","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gjergji Kasneci","raw_affiliation_strings":["Max-Planck-Institute for Computer Science"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute for Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031710345","display_name":"Thomas Schwentick","orcid":"https://orcid.org/0000-0002-1062-922X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Schwentick","raw_affiliation_strings":["University of Dortmund"],"affiliations":[{"raw_affiliation_string":"University of Dortmund","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024434748"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0104,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80954516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"164"},"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.9995999932289124,"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.9995999932289124,"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/T10215","display_name":"Semantic Web and Ontologies","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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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.6994704008102417},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.6788450479507446},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.6512036323547363},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.629416286945343},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.5953608751296997},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5767855048179626},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5095810890197754},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5010662078857422},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4848983883857727},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46415576338768005},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4538083076477051},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.40232011675834656},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3638817369937897},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.2911103367805481},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29109716415405273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2556912899017334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25361937284469604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2412683069705963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6994704008102417},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.6788450479507446},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.6512036323547363},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.629416286945343},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.5953608751296997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5767855048179626},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5095810890197754},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5010662078857422},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4848983883857727},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46415576338768005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4538083076477051},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.40232011675834656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3638817369937897},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.2911103367805481},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29109716415405273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2556912899017334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25361937284469604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2412683069705963},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1265530.1265552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265552","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-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.6180","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.6180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~kasneci/download/xmlschemas_pods2007.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.1237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.1237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ls1-www.cs.uni-dortmund.de/~tick/Papers/pods07a.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:356479","is_oa":false,"landing_page_url":"http://edoc.mpg.de/356479","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Libkin, Leonid: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems : PODS 2007, ACM, 155-164 (2007)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1328119","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-20F7-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems : PODS 2007","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W261652732","https://openalex.org/W1485606779","https://openalex.org/W1568320863","https://openalex.org/W1573061520","https://openalex.org/W1579407214","https://openalex.org/W1580455323","https://openalex.org/W1593799327","https://openalex.org/W1965014786","https://openalex.org/W1983304353","https://openalex.org/W2030473999","https://openalex.org/W2057841333","https://openalex.org/W2092398161","https://openalex.org/W2105748890","https://openalex.org/W2117578496","https://openalex.org/W2159668267","https://openalex.org/W2183421559","https://openalex.org/W2292993340","https://openalex.org/W3104723580","https://openalex.org/W6634447015"],"related_works":["https://openalex.org/W2026191634","https://openalex.org/W1558283425","https://openalex.org/W2199053348","https://openalex.org/W2950697114","https://openalex.org/W1559485762","https://openalex.org/W2404907747","https://openalex.org/W2020230082","https://openalex.org/W1530851674","https://openalex.org/W1536883094","https://openalex.org/W4244808067"],"abstract_inverted_index":{"In":[0],"a":[1,8,38,50,59],"recent":[2],"paper,":[3],"Martens":[4],"et":[5],"al.":[6],"introduced":[7],"specification":[9],"mechanism":[10],"for":[11,54,117],"XML":[12,42],"tree":[13,43],"languages,":[14],"based":[15],"on":[16],"rules":[17,30],"of":[18,28,66,75,95],"the":[19,63,67,72,76,93,103,106],"form":[20],"(r,s),":[21],"wherer,":[22],"s":[23],"are":[24,115,122],"regular":[25],"expressions.":[26],"Sets":[27],"such":[29,61,98],"can":[31],"be":[32],"interpreted":[33],"in":[34,101,110],"an":[35],"existential":[36],"or":[37],"universal":[39],"fashion.":[40],"An":[41],"is":[44,58,80],"existentially":[45],"valid":[46,82],"with":[47,124],"respect":[48],"to":[49],"rule":[51,60,99],"set,":[52],"if":[53,83],"each":[55,84],"node":[56,68,77,85],"there":[57],"that":[62],"root":[64],"path":[65],"matches":[69],"r":[70,87],"and":[71,105,126],"children":[73],"sequence":[74],"matchess.":[78,89],"It":[79],"universally":[81],"matching":[86],"also":[88],"This":[90],"paper":[91],"investigates":[92],"complexity":[94],"reasoning":[96,113],"about":[97],"sets,":[100],"particular":[102],"satisfiability":[104],"implication":[107],"problem.":[108],"Whereas,":[109],"general":[111],"these":[112],"problems":[114],"complete":[116],"EXPTIME,":[118],"two":[119],"important":[120],"fragments":[121],"identified":[123],"PSPACE":[125],"PTIME":[127],"complexity,":[128],"respectively.":[129]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}