{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:21:06Z","timestamp":1703290866003},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"The relational calculus (RC) is a concise, declarative query language.\nHowever, existing RC query evaluation approaches are inefficient and often\ndeviate from established algorithms based on finite tables used in database\nmanagement systems. We devise a new translation of an arbitrary RC query into\ntwo safe-range queries, for which the finiteness of the query's evaluation\nresult is guaranteed. Assuming an infinite domain, the two queries have the\nfollowing meaning: The first is closed and characterizes the original query's\nrelative safety, i.e., whether given a fixed database, the original query\nevaluates to a finite relation. The second safe-range query is equivalent to\nthe original query, if the latter is relatively safe. We compose our\ntranslation with other, more standard ones to ultimately obtain two SQL\nqueries. This allows us to use standard database management systems to evaluate\narbitrary RC queries. We show that our translation improves the time complexity\nover existing approaches, which we also empirically confirm in both realistic\nand synthetic experiments.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:38)2023","type":"journal-article","created":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T07:55:12Z","timestamp":1703231712000},"source":"Crossref","is-referenced-by-count":0,"title":["Efficient Evaluation of Arbitrary Relational Calculus Queries"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Martin","family":"Raszyk","sequence":"first","affiliation":[]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[]},{"given":"Sr\u0111an","family":"Krsti\u0107","sequence":"additional","affiliation":[]},{"given":"Dmitriy","family":"Traytel","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2023,12,22]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12737\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12737\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T07:55:12Z","timestamp":1703231712000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,22]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:38)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2210.09964v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.09964v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2210.09964","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2210.09964","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,22]]}}}