{"id":"https://openalex.org/W2156717879","doi":"https://doi.org/10.1145/1142351.1142363","title":"The containment problem for <bi>Real</bi> conjunctive queries with inequalities","display_name":"The containment problem for <bi>Real</bi> conjunctive queries with inequalities","publication_year":2006,"publication_date":"2006-06-26","ids":{"openalex":"https://openalex.org/W2156717879","doi":"https://doi.org/10.1145/1142351.1142363","mag":"2156717879"},"language":"en","primary_location":{"id":"doi:10.1145/1142351.1142363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142363","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/A5023204485","display_name":"T. S. Jayram","orcid":"https://orcid.org/0000-0001-5235-4853"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. S. Jayram","raw_affiliation_strings":["IBM Almaden"],"affiliations":[{"raw_affiliation_string":"IBM Almaden","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041825861","display_name":"Phokion G. Kolaitis","orcid":"https://orcid.org/0000-0002-8407-8563"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Phokion G. Kolaitis","raw_affiliation_strings":["IBM Almaden"],"affiliations":[{"raw_affiliation_string":"IBM Almaden","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049077665","display_name":"Erik Vee","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik Vee","raw_affiliation_strings":["IBM Almaden"],"affiliations":[{"raw_affiliation_string":"IBM Almaden","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023204485"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":3.7824,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.93953625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"89"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987999796867371,"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/conjunctive-query","display_name":"Conjunctive query","score":0.8527759313583374},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7834747433662415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5980451107025146},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5598033666610718},{"id":"https://openalex.org/keywords/containment","display_name":"Containment (computer programming)","score":0.5582157373428345},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5063043832778931},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5014135837554932},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.459308922290802},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4459180533885956},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.42434513568878174},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4240185618400574},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4210493564605713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35474538803100586},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35295456647872925},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3525850772857666},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.26599109172821045},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.26322266459465027},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24283930659294128},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.20794793963432312},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.1749868392944336},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.14972370862960815}],"concepts":[{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.8527759313583374},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7834747433662415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5980451107025146},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5598033666610718},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.5582157373428345},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5063043832778931},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5014135837554932},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.459308922290802},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4459180533885956},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.42434513568878174},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4240185618400574},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4210493564605713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35474538803100586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35295456647872925},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3525850772857666},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.26599109172821045},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.26322266459465027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24283930659294128},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.20794793963432312},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.1749868392944336},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.14972370862960815},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1142351.1142363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142363","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":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1538511702","https://openalex.org/W1979514837","https://openalex.org/W2028864278","https://openalex.org/W2031639195","https://openalex.org/W2048531653","https://openalex.org/W2051192787","https://openalex.org/W2055586952","https://openalex.org/W2056660085","https://openalex.org/W2079590017","https://openalex.org/W2082788828","https://openalex.org/W2107308446","https://openalex.org/W2149149441","https://openalex.org/W2163491591","https://openalex.org/W2996968859","https://openalex.org/W4213009134","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W1483388050","https://openalex.org/W2137382312","https://openalex.org/W1894718966","https://openalex.org/W2258149899","https://openalex.org/W2004485491","https://openalex.org/W4387929624","https://openalex.org/W2574914925","https://openalex.org/W2111229178","https://openalex.org/W2023076960","https://openalex.org/W1769027017"],"abstract_inverted_index":{"Query":[0],"containment":[1],"is":[2,92,99,125,151,162,191],"a":[3,87,180,194],"fundamental":[4],"algorithmic":[5],"problem":[6,18,72,83,98,108,124,145,161],"in":[7,89],"database":[8,31],"query":[9],"processing":[10],"and":[11,53,184],"optimization.":[12],"Under":[13],"set":[14,42,121],"semantics,":[15,40,105,122,142],"the":[16,70,106,128,132,143,156,166,172,176,186,199],"query-containment":[17,71,107,144],"for":[19,73,84,109,127,146],"conjunctive":[20,74,110,147],"queries":[21,34,47,75,111,148,177],"has":[22,79,115],"long":[23],"been":[24,80,116],"known":[25,95],"to":[26],"be":[27],"NP-complete.":[28],"In":[29,44],"real":[30],"systems,":[32],"however,":[33],"are":[35,48,60],"usually":[36],"evaluated":[37,49],"under":[38,50,76,103,120,140,204],"bag":[39,51,77,104,141],"not":[41,61,93],"semantics.":[43,206],"particular,":[45],"SQL":[46],"semantics":[52,78],"return":[54],"multisets":[55],"as":[56],"answers,":[57],"since":[58],"duplicates":[59],"eliminated":[62],"unless":[63],"explicitly":[64],"requested.":[65],"The":[66],"exact":[67],"complexity":[68],"of":[69,131,189],"an":[81],"open":[82],"more":[85],"than":[86],"decade;":[88],"fact,":[90],"it":[91],"even":[94,164],"whether":[96],"this":[97,123,160],"decidable.Here,":[100],"we":[101,154],"investigate,":[102],"with":[112,149],"inequalities.":[113],"It":[114],"previously":[117],"shown":[118],"that,":[119,139],"complete":[126],"second":[129],"level":[130],"polynomial":[133],"hierarchy.":[134],"Our":[135],"main":[136],"result":[137,158],"asserts":[138],"inequalities":[150,190],"undecidable.":[152],"Actually,":[153],"establish":[155],"stronger":[157],"that":[159],"undecidable":[163],"if":[165],"following":[167],"two":[168],"restrictions":[169],"hold":[170,203],"at":[171],"same":[173,200],"time:":[174],"(1)":[175],"use":[178],"just":[179],"single":[181],"binary":[182],"relation;":[183],"(2)":[185],"total":[187],"number":[188],"bounded":[192],"by":[193],"certain":[195],"fixed":[196],"value.":[197],"Moreover,":[198],"undecidability":[201],"results":[202],"bag-set":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-10T00:00:00"}