{"id":"https://openalex.org/W2130767402","doi":"https://doi.org/10.1145/1938551.1938572","title":"Satisfiability algorithms for conjunctive queries over trees","display_name":"Satisfiability algorithms for conjunctive queries over trees","publication_year":2011,"publication_date":"2011-02-08","ids":{"openalex":"https://openalex.org/W2130767402","doi":"https://doi.org/10.1145/1938551.1938572","mag":"2130767402"},"language":"en","primary_location":{"id":"doi:10.1145/1938551.1938572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/d2c4be8e-4a4b-4e00-be5e-7445c0097019","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056138547","display_name":"James Cheney","orcid":"https://orcid.org/0000-0002-1307-9286"},"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":"James Cheney","raw_affiliation_strings":["LFCS, University of Edinburgh","LFCS - University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"LFCS, University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"LFCS - University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056138547"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":1.4574,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84029715,"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":"150","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9952999949455261,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9952999949455261,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9926000237464905,"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/T11106","display_name":"Data Management and Algorithms","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8685785531997681},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7303129434585571},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7083658576011658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6516541242599487},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5451842546463013},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.46605759859085083},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43921124935150146},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4369368851184845},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42252954840660095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4203704595565796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3085276782512665},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.13867464661598206}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.8685785531997681},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7303129434585571},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7083658576011658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6516541242599487},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5451842546463013},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.46605759859085083},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43921124935150146},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4369368851184845},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42252954840660095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4203704595565796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3085276782512665},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.13867464661598206},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1938551.1938572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.3064","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064","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/2011-Uppsala/papers/icdt/a15-cheney.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/d2c4be8e-4a4b-4e00-be5e-7445c0097019","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d2c4be8e-4a4b-4e00-be5e-7445c0097019","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cheney, J 2011, Satisfiability algorithms for conjunctive queries over trees. in ICDT. pp. 150-161.","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/d2c4be8e-4a4b-4e00-be5e-7445c0097019","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/satisfiability-algorithms-for-conjunctive-queries-over-trees(d2c4be8e-4a4b-4e00-be5e-7445c0097019).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/d2c4be8e-4a4b-4e00-be5e-7445c0097019","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d2c4be8e-4a4b-4e00-be5e-7445c0097019","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cheney, J 2011, Satisfiability algorithms for conjunctive queries over trees. in ICDT. pp. 150-161.","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W92576581","https://openalex.org/W1513019207","https://openalex.org/W1516630410","https://openalex.org/W1545551248","https://openalex.org/W1558180533","https://openalex.org/W1558832481","https://openalex.org/W1580127085","https://openalex.org/W1716100575","https://openalex.org/W1983524017","https://openalex.org/W1989251775","https://openalex.org/W1991960436","https://openalex.org/W2022846948","https://openalex.org/W2063039776","https://openalex.org/W2087404282","https://openalex.org/W2095120159","https://openalex.org/W2111507892","https://openalex.org/W2119397055","https://openalex.org/W2136834295","https://openalex.org/W2159786179","https://openalex.org/W2570710533","https://openalex.org/W2611888112","https://openalex.org/W2741923656","https://openalex.org/W4206031975","https://openalex.org/W4285719527","https://openalex.org/W6603841182","https://openalex.org/W6633513001","https://openalex.org/W6634746015","https://openalex.org/W6647606546"],"related_works":["https://openalex.org/W1486715727","https://openalex.org/W2743317844","https://openalex.org/W2594077579","https://openalex.org/W2041536784","https://openalex.org/W1978299898","https://openalex.org/W2147888141","https://openalex.org/W1536883094","https://openalex.org/W85597501","https://openalex.org/W2055547270","https://openalex.org/W3035344570"],"abstract_inverted_index":{"We":[0,23,50,58],"investigate":[1],"the":[2,36,61,106],"satisfiability":[3],"problem":[4,40],"for":[5,55,95],"conjunctions":[6],"of":[7,38,63,71,74,101],"constraints":[8],"over":[9,90],"ordered,":[10],"unranked":[11],"trees,":[12],"including":[13],"child,":[14],"descendant,":[15],"following-sibling,":[16],"root,":[17],"leaf,":[18],"and":[19,34,42,53,68],"first/last":[20],"child":[21],"constraints.":[22],"introduce":[24],"new,":[25],"symbolic":[26],"approaches":[27],"based":[28],"on":[29],"graph":[30],"transformations,":[31],"which":[32,108],"simplify":[33],"check":[35],"consistency":[37],"a":[39,98],"first,":[41],"delay":[43],"blind":[44],"search":[45],"as":[46,48],"long":[47],"possible.":[49],"prove":[51],"correctness":[52],"termination":[54],"these":[56],"algorithms.":[57],"also":[59],"analyze":[60],"complexity":[62,79],"important":[64],"special":[65],"cases:":[66],"binary":[67,83],"\u03ba-ary":[69],"intersection":[70,84],"certain":[72],"classes":[73],"XPath":[75,89],"expressions.":[76],"Our":[77],"main":[78],"result":[80],"is":[81,93,109],"that":[82],"(for":[85],"positive,":[86],"simple":[87],"navigational":[88],"all":[91],"axes)":[92],"tractable":[94],"expressions":[96],"with":[97],"bounded":[99],"number":[100],"changes":[102],"in":[103,105],"direction":[104],"path,":[107],"typically":[110],"small.":[111]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}