{"id":"https://openalex.org/W1982412013","doi":"https://doi.org/10.1145/1451940.1451957","title":"A unified apriori-like algorithm for conjunctive query containment","display_name":"A unified apriori-like algorithm for conjunctive query containment","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1982412013","doi":"https://doi.org/10.1145/1451940.1451957","mag":"1982412013"},"language":"en","primary_location":{"id":"doi:10.1145/1451940.1451957","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1451940.1451957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 international symposium on Database engineering &amp; applications - IDEAS '08","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/A5110199019","display_name":"Fang Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Fang Wei","raw_affiliation_strings":["University of Freiburg","Univ. of Freiburg"],"affiliations":[{"raw_affiliation_string":"University of Freiburg","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Univ. of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113532644","display_name":"Georg Lausen","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg Lausen","raw_affiliation_strings":["University of Freiburg","Univ. of Freiburg"],"affiliations":[{"raw_affiliation_string":"University of Freiburg","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Univ. of Freiburg","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110199019"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0862235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"111"},"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.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/containment","display_name":"Containment (computer programming)","score":0.8676297664642334},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.7882267832756042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7632694244384766},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.6578583121299744},{"id":"https://openalex.org/keywords/apriori-algorithm","display_name":"Apriori algorithm","score":0.6418080925941467},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.59236079454422},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.579841673374176},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.46224474906921387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43865156173706055},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3804439604282379},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.31675058603286743},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.19871222972869873},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19451075792312622},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.18365153670310974},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.1548886001110077},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.10167613625526428},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.08356606960296631},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.06482389569282532}],"concepts":[{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.8676297664642334},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.7882267832756042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7632694244384766},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.6578583121299744},{"id":"https://openalex.org/C81440476","wikidata":"https://www.wikidata.org/wiki/Q513511","display_name":"Apriori algorithm","level":3,"score":0.6418080925941467},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.59236079454422},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.579841673374176},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.46224474906921387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43865156173706055},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3804439604282379},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.31675058603286743},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.19871222972869873},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19451075792312622},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.18365153670310974},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.1548886001110077},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.10167613625526428},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.08356606960296631},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.06482389569282532},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/1451940.1451957","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1451940.1451957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 international symposium on Database engineering &amp; applications - IDEAS '08","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W1505230898","https://openalex.org/W1506285740","https://openalex.org/W1558832481","https://openalex.org/W1572571126","https://openalex.org/W1584916681","https://openalex.org/W1597161471","https://openalex.org/W1803582651","https://openalex.org/W1979514837","https://openalex.org/W2026745535","https://openalex.org/W2028864278","https://openalex.org/W2030969394","https://openalex.org/W2033325972","https://openalex.org/W2037965136","https://openalex.org/W2076126314","https://openalex.org/W2102729564","https://openalex.org/W2108930340","https://openalex.org/W2114883263","https://openalex.org/W2123910684","https://openalex.org/W2126004201","https://openalex.org/W2152191782","https://openalex.org/W2462092264"],"related_works":["https://openalex.org/W1483388050","https://openalex.org/W2137382312","https://openalex.org/W2004485491","https://openalex.org/W4298325446","https://openalex.org/W1492449180","https://openalex.org/W2964058024","https://openalex.org/W2156776134","https://openalex.org/W1558141798","https://openalex.org/W2149149441","https://openalex.org/W1552362068"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,32,50],"containment":[3],"checking":[4],"algorithms":[5,36],"for":[6],"conjunctive":[7],"queries":[8],"with":[9,46],"arithmetic":[10],"comparisons":[11],"and":[12],"safe":[13],"negations":[14],"(CQ\u00ac\u2260s)":[15],"is":[16,24],"fundamental":[17],"to":[18,29,44],"many":[19],"database":[20],"applications.":[21],"However,":[22],"it":[23],"a":[25,48],"challenging":[26],"task":[27],"due":[28],"the":[30,33],"intractability":[31],"problem.":[34],"Existing":[35],"are":[37],"either":[38],"computationally":[39],"too":[40],"expensive,":[41],"or":[42],"capable":[43],"deal":[45],"only":[47],"fragment":[49],"these":[51],"extensions.":[52]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
