{"id":"https://openalex.org/W4390109145","doi":"https://doi.org/10.46298/lmcs-19(4:38)2023","title":"Efficient Evaluation of Arbitrary Relational Calculus Queries","display_name":"Efficient Evaluation of Arbitrary Relational Calculus Queries","publication_year":2023,"publication_date":"2023-12-22","ids":{"openalex":"https://openalex.org/W4390109145","doi":"https://doi.org/10.46298/lmcs-19(4:38)2023"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(4:38)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:38)2023","pdf_url":"https://lmcs.episciences.org/12737/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/12737/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020812040","display_name":"Martin Raszyk","orcid":"https://orcid.org/0000-0003-3018-2557"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Martin Raszyk","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","DFINITY, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"DFINITY, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025344654","display_name":"David Basin","orcid":"https://orcid.org/0000-0003-2952-939X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Basin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028440299","display_name":"Sr\u0111an Krsti\u0107","orcid":"https://orcid.org/0000-0001-8314-2589"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sr\u0111an Krsti\u0107","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046106256","display_name":"Dmitriy Traytel","orcid":"https://orcid.org/0000-0001-7982-2768"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Dmitriy Traytel","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020812040"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.1974,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54581556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"Volume 19, Issue 4","issue":null,"first_page":null,"last_page":null},"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.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"}},"topics":[{"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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/relational-calculus","display_name":"Relational calculus","score":0.747498631477356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.713215708732605},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.5511674880981445},{"id":"https://openalex.org/keywords/codds-theorem","display_name":"Codd's theorem","score":0.497983455657959},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.4464951753616333},{"id":"https://openalex.org/keywords/pi-calculus","display_name":"Pi calculus","score":0.4323728084564209},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.42840760946273804},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.41533416509628296},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39886003732681274},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.39488279819488525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24754378199577332},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2035263180732727},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07817625999450684}],"concepts":[{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.747498631477356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.713215708732605},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.5511674880981445},{"id":"https://openalex.org/C16739119","wikidata":"https://www.wikidata.org/wiki/Q5139948","display_name":"Codd's theorem","level":5,"score":0.497983455657959},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.4464951753616333},{"id":"https://openalex.org/C2984882572","wikidata":"https://www.wikidata.org/wiki/Q602886","display_name":"Pi calculus","level":2,"score":0.4323728084564209},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.42840760946273804},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41533416509628296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39886003732681274},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.39488279819488525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24754378199577332},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2035263180732727},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07817625999450684},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-19(4:38)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:38)2023","pdf_url":"https://lmcs.episciences.org/12737/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8705315f0b46493d8d1b6d4ce8b1d075","is_oa":true,"landing_page_url":"https://doaj.org/article/8705315f0b46493d8d1b6d4ce8b1d075","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a995b04f-983d-40dc-b500-bc79e29fe6c1","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/a995b04f-983d-40dc-b500-bc79e29fe6c1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Raszyk , M , Basin , D , Krsti\u0107 , S & Trayte , D 2023 , ' Efficient Evaluation of Arbitrary Relational Calculus Queries ' , Logical Methods in Computer Science , vol. 19 , no. 4 . https://doi.org/10.46298/lmcs-19(4:38)2023","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(4:38)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:38)2023","pdf_url":"https://lmcs.episciences.org/12737/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2909101356","display_name":null,"funder_award_id":"NNF20OC0063462","funder_id":"https://openalex.org/F4320325957","funder_display_name":"Novo Nordisk Fonden"},{"id":"https://openalex.org/G3932096614","display_name":null,"funder_award_id":"167162","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4901042947","display_name":"Multivariate analysis of risk and protective factors of general delinquency in young men.","funder_award_id":"67162","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G5725153931","display_name":"Model-driven Security & Privacy","funder_award_id":"204796","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G6418117284","display_name":"Synthese neuer Verbindungen, die in ultrad\u00fcnnen Schichten auf planare Tr\u00e4ger aufgebracht werden k\u00f6nnen.","funder_award_id":"20479","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320322436","display_name":"Novo Nordisk","ror":"https://ror.org/0435rc536"},{"id":"https://openalex.org/F4320325957","display_name":"Novo Nordisk Fonden","ror":"https://ror.org/04txyc737"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4390109145.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W15008848","https://openalex.org/W297262571","https://openalex.org/W1489366126","https://openalex.org/W1524668325","https://openalex.org/W1532667386","https://openalex.org/W1751719170","https://openalex.org/W1966217515","https://openalex.org/W1989783863","https://openalex.org/W1990748731","https://openalex.org/W2004648467","https://openalex.org/W2005440900","https://openalex.org/W2027639996","https://openalex.org/W2031856459","https://openalex.org/W2065603413","https://openalex.org/W2106716639","https://openalex.org/W2112512808","https://openalex.org/W2120127771","https://openalex.org/W2122719199","https://openalex.org/W2143210706","https://openalex.org/W2149675716","https://openalex.org/W2161956202","https://openalex.org/W2267240189","https://openalex.org/W2536131596","https://openalex.org/W2963560792","https://openalex.org/W2971196067","https://openalex.org/W4206031975","https://openalex.org/W4244028915","https://openalex.org/W4412280681"],"related_works":["https://openalex.org/W2085988990","https://openalex.org/W2005835473","https://openalex.org/W2056340443","https://openalex.org/W60748262","https://openalex.org/W2378275298","https://openalex.org/W4362564457","https://openalex.org/W3022423983","https://openalex.org/W83887196","https://openalex.org/W2117881132","https://openalex.org/W1487241321"],"abstract_inverted_index":{"The":[0,69,94],"relational":[1],"calculus":[2],"(RC)":[3],"is":[4,56,71,98,107],"a":[5,35,83,91],"concise,":[6],"declarative":[7],"query":[8,13,42,88,97],"language.":[9],"However,":[10],"existing":[11,149],"RC":[12,41,137],"evaluation":[14,54],"approaches":[15],"are":[16],"inefficient":[17],"and":[18,73,159],"often":[19],"deviate":[20],"from":[21],"established":[22],"algorithms":[23],"based":[24],"on":[25],"finite":[26,92],"tables":[27],"used":[28],"in":[29,156],"database":[30,131],"management":[31,132],"systems.":[32],"We":[33,110,139],"devise":[34],"new":[36],"translation":[37,113,143],"of":[38,51],"an":[39,59],"arbitrary":[40,136],"into":[43],"two":[44,63,122],"safe-range":[45,96],"queries,":[46],"for":[47],"which":[48,151],"the":[49,52,62,66,75,86,101,105,145],"finiteness":[50],"query's":[53,77],"result":[55],"guaranteed.":[57],"Assuming":[58],"infinite":[60],"domain,":[61],"queries":[64],"have":[65],"following":[67],"meaning:":[68],"first":[70],"closed":[72],"characterizes":[74],"original":[76,87,102],"relative":[78],"safety,":[79],"i.e.,":[80],"whether":[81],"given":[82],"fixed":[84],"database,":[85],"evaluates":[89],"to":[90,100,119,128,134],"relation.":[93],"second":[95],"equivalent":[99],"query,":[103],"if":[104],"latter":[106],"relatively":[108],"safe.":[109],"compose":[111],"our":[112,142],"with":[114],"other,":[115],"more":[116],"standard":[117,130],"ones":[118],"ultimately":[120],"obtain":[121],"SQL":[123],"queries.":[124,138],"This":[125],"allows":[126],"us":[127],"use":[129],"systems":[133],"evaluate":[135],"show":[140],"that":[141],"improves":[144],"time":[146],"complexity":[147],"over":[148],"approaches,":[150],"we":[152],"also":[153],"empirically":[154],"confirm":[155],"both":[157],"realistic":[158],"synthetic":[160],"experiments.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}