{"id":"https://openalex.org/W2164743697","doi":"https://doi.org/10.1145/1938551.1938575","title":"On the optimal approximation of queries using tractable propositional languages","display_name":"On the optimal approximation of queries using tractable propositional languages","publication_year":2011,"publication_date":"2011-02-08","ids":{"openalex":"https://openalex.org/W2164743697","doi":"https://doi.org/10.1145/1938551.1938575","mag":"2164743697"},"language":"en","primary_location":{"id":"doi:10.1145/1938551.1938575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938575","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056275746","display_name":"Robert Fink","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":"Robert Fink","raw_affiliation_strings":["Oxford University Computing Laboratory"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035180920","display_name":"Dan Olteanu","orcid":"https://orcid.org/0000-0002-4682-7068"},"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":"Dan Olteanu","raw_affiliation_strings":["Oxford University Computing Laboratory"],"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056275746"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":5.9271,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96980936,"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":"174","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9994999766349792,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9954000115394592,"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/transitive-closure","display_name":"Transitive closure","score":0.7195098996162415},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.634671151638031},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6149519085884094},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.5638768672943115},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5002748966217041},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.4847654700279236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4843376874923706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48277488350868225},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.47380155324935913},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.45689982175827026},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.4481316804885864},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42924126982688904},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.42808839678764343},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42150044441223145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33417361974716187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32117384672164917},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.30055126547813416},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14465123414993286},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.13272911310195923},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09188997745513916}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7195098996162415},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.634671151638031},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6149519085884094},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.5638768672943115},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5002748966217041},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.4847654700279236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4843376874923706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48277488350868225},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.47380155324935913},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.45689982175827026},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4481316804885864},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42924126982688904},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.42808839678764343},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42150044441223145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33417361974716187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32117384672164917},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.30055126547813416},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14465123414993286},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.13272911310195923},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09188997745513916},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1938551.1938575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938575","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.188.5249","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.5249","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/people/dan.olteanu/papers/fo-icdt11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.330.6924","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://delivery.acm.org/10.1145/1940000/1938575/p174-fink.pdf?CFID%3D185392419%26CFTOKEN%3D31351820%26__acm__%3D1362093556_6d1a54a2b3b09ff06e231c5b1b439f81%26acc%3DACTIVE+SERVICE%26ip%3D130.203.136.92","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.428.8594","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.428.8594","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/a17-fink.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G582362311","display_name":null,"funder_award_id":"FP7-ICT-233599","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1490859187","https://openalex.org/W1515568087","https://openalex.org/W1586825695","https://openalex.org/W1792069554","https://openalex.org/W1823092762","https://openalex.org/W1990391007","https://openalex.org/W2007940874","https://openalex.org/W2012041962","https://openalex.org/W2038897673","https://openalex.org/W2049199200","https://openalex.org/W2056660085","https://openalex.org/W2064234215","https://openalex.org/W2078686663","https://openalex.org/W2089417393","https://openalex.org/W2093149131","https://openalex.org/W2114334214","https://openalex.org/W2124647958","https://openalex.org/W2132519377","https://openalex.org/W2137485709","https://openalex.org/W2164688391","https://openalex.org/W2293299776","https://openalex.org/W3099451540","https://openalex.org/W4206807714"],"related_works":["https://openalex.org/W20972493","https://openalex.org/W2338525844","https://openalex.org/W2951257011","https://openalex.org/W4299540831","https://openalex.org/W2964256304","https://openalex.org/W2896766859","https://openalex.org/W4297895951","https://openalex.org/W4288363924","https://openalex.org/W4301141272","https://openalex.org/W2926816154"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,57,128,138],"problem":[4,28,129],"of":[5,59,70,80,85,130],"approximating":[6],"conjunctive":[7],"queries":[8,107,111,142],"without":[9],"self-joins":[10],"on":[11],"probabilistic":[12,122],"databases":[13],"by":[14,106,141],"lower":[15,47],"and":[16,49,69,82,91,116],"upper":[17,51],"bounds":[18,87,102,139],"that":[19,44,94],"can":[20,95,103,125,143],"be":[21,104,144],"computed":[22,105,145],"more":[23,41],"efficiently.":[24],"We":[25,55,77],"study":[26],"this":[27],"via":[29],"an":[30],"indirection:":[31],"Given":[32],"a":[33,40,117],"propositional":[34],"formula":[35],"\u03a6,":[36],"find":[37],"formulas":[38,72],"in":[39,73,134,146],"restricted":[42],"language":[43],"are":[45],"greatest":[46],"bound":[48],"least":[50],"bound,":[52],"respectively,":[53],"of\u03a6.":[54],"studyboundsin":[56],"languages":[58],"read-once":[60,71],"formulas,":[61,90],"where":[62],"every":[63],"variable":[64],"occurs":[65],"at":[66],"most":[67],"once,":[68],"disjunctive":[74],"normal":[75],"form.":[76],"show":[78],"equivalences":[79],"syntactic":[81],"model-theoretic":[83],"characterisations":[84],"optimal":[86],"for":[88],"unate":[89],"present":[92],"algorithms":[93],"enumerate":[96],"them":[97],"with":[98,113],"polynomial":[99,147],"delay.":[100],"Such":[101],"expressed":[108,140],"using":[109],"first-order":[110],"extended":[112],"transitive":[114],"closure":[115],"special":[118],"choice":[119],"construct.":[120],"Besides":[121],"databases,":[123,136],"theseresults":[124],"also":[126],"benefit":[127],"approximate":[131],"query":[132],"evaluation":[133],"relational":[135],"since":[137],"combined":[148],"complexity.":[149],"Categories":[150],"andSubject":[151],"Descriptors":[152],"H.2.4":[153],"[Database":[154],"Management]:":[155],"Systems\u2014Query":[156],"Processing":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}