Efficient Evaluation of Arbitrary Relational Calculus Queries Article Swipe
Martin Raszyk
,
David Basin
,
Srđan Krstić
,
Dmitriy Traytel
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.46298/lmcs-19(4:38)2023
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.46298/lmcs-19(4:38)2023
The relational calculus (RC) is a concise, declarative query language. However, existing RC query evaluation approaches are inefficient and often deviate from established algorithms based on finite tables used in database management systems. We devise a new translation of an arbitrary RC query into two safe-range queries, for which the finiteness of the query's evaluation result is guaranteed. Assuming an infinite domain, the two queries have the following meaning: The first is closed and characterizes the original query's relative safety, i.e., whether given a fixed database, the original query evaluates to a finite relation. The second safe-range query is equivalent to the original query, if the latter is relatively safe. We compose our translation with other, more standard ones to ultimately obtain two SQL queries. This allows us to use standard database management systems to evaluate arbitrary RC queries. We show that our translation improves the time complexity over existing approaches, which we also empirically confirm in both realistic and synthetic experiments.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.46298/lmcs-19(4:38)2023
- https://lmcs.episciences.org/12737/pdf
- OA Status
- diamond
- Cited By
- 1
- References
- 28
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4390109145
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4390109145Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.46298/lmcs-19(4:38)2023Digital Object Identifier
- Title
-
Efficient Evaluation of Arbitrary Relational Calculus QueriesWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-12-22Full publication date if available
- Authors
-
Martin Raszyk, David Basin, Srđan Krstić, Dmitriy TraytelList of authors in order
- Landing page
-
https://doi.org/10.46298/lmcs-19(4:38)2023Publisher landing page
- PDF URL
-
https://lmcs.episciences.org/12737/pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://lmcs.episciences.org/12737/pdfDirect OA link when available
- Concepts
-
Relational calculus, Computer science, Relational database, Codd's theorem, Relational model, Pi calculus, Calculus (dental), Programming language, Theoretical computer science, Algebra over a field, Mathematics, Database, Pure mathematics, Medicine, DentistryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
- References (count)
-
28Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4390109145 |
|---|---|
| doi | https://doi.org/10.46298/lmcs-19(4:38)2023 |
| ids.doi | https://doi.org/10.46298/lmcs-19(4:38)2023 |
| ids.openalex | https://openalex.org/W4390109145 |
| fwci | 0.43955229 |
| type | article |
| title | Efficient Evaluation of Arbitrary Relational Calculus Queries |
| biblio.issue | |
| biblio.volume | Volume 19, Issue 4 |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10317 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9994999766349792 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Advanced Database Systems and Queries |
| topics[1].id | https://openalex.org/T10538 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9983999729156494 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1710 |
| topics[1].subfield.display_name | Information Systems |
| topics[1].display_name | Data Mining Algorithms and Applications |
| topics[2].id | https://openalex.org/T11106 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9973000288009644 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1711 |
| topics[2].subfield.display_name | Signal Processing |
| topics[2].display_name | Data Management and Algorithms |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C99436015 |
| concepts[0].level | 4 |
| concepts[0].score | 0.747498631477356 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1722436 |
| concepts[0].display_name | Relational calculus |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.713215708732605 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C5655090 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5511674880981445 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q192588 |
| concepts[2].display_name | Relational database |
| concepts[3].id | https://openalex.org/C16739119 |
| concepts[3].level | 5 |
| concepts[3].score | 0.497983455657959 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q5139948 |
| concepts[3].display_name | Codd's theorem |
| concepts[4].id | https://openalex.org/C40207289 |
| concepts[4].level | 3 |
| concepts[4].score | 0.4464951753616333 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q755662 |
| concepts[4].display_name | Relational model |
| concepts[5].id | https://openalex.org/C2984882572 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4323728084564209 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q602886 |
| concepts[5].display_name | Pi calculus |
| concepts[6].id | https://openalex.org/C2777686260 |
| concepts[6].level | 2 |
| concepts[6].score | 0.42840760946273804 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q144037 |
| concepts[6].display_name | Calculus (dental) |
| concepts[7].id | https://openalex.org/C199360897 |
| concepts[7].level | 1 |
| concepts[7].score | 0.41533416509628296 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[7].display_name | Programming language |
| concepts[8].id | https://openalex.org/C80444323 |
| concepts[8].level | 1 |
| concepts[8].score | 0.39886003732681274 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[8].display_name | Theoretical computer science |
| concepts[9].id | https://openalex.org/C136119220 |
| concepts[9].level | 2 |
| concepts[9].score | 0.39488279819488525 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1000660 |
| concepts[9].display_name | Algebra over a field |
| concepts[10].id | https://openalex.org/C33923547 |
| concepts[10].level | 0 |
| concepts[10].score | 0.24754378199577332 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[10].display_name | Mathematics |
| concepts[11].id | https://openalex.org/C77088390 |
| concepts[11].level | 1 |
| concepts[11].score | 0.2035263180732727 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[11].display_name | Database |
| concepts[12].id | https://openalex.org/C202444582 |
| concepts[12].level | 1 |
| concepts[12].score | 0.07817625999450684 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q837863 |
| concepts[12].display_name | Pure mathematics |
| concepts[13].id | https://openalex.org/C71924100 |
| concepts[13].level | 0 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q11190 |
| concepts[13].display_name | Medicine |
| concepts[14].id | https://openalex.org/C199343813 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q12128 |
| concepts[14].display_name | Dentistry |
| keywords[0].id | https://openalex.org/keywords/relational-calculus |
| keywords[0].score | 0.747498631477356 |
| keywords[0].display_name | Relational calculus |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.713215708732605 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/relational-database |
| keywords[2].score | 0.5511674880981445 |
| keywords[2].display_name | Relational database |
| keywords[3].id | https://openalex.org/keywords/codds-theorem |
| keywords[3].score | 0.497983455657959 |
| keywords[3].display_name | Codd's theorem |
| keywords[4].id | https://openalex.org/keywords/relational-model |
| keywords[4].score | 0.4464951753616333 |
| keywords[4].display_name | Relational model |
| keywords[5].id | https://openalex.org/keywords/pi-calculus |
| keywords[5].score | 0.4323728084564209 |
| keywords[5].display_name | Pi calculus |
| keywords[6].id | https://openalex.org/keywords/calculus |
| keywords[6].score | 0.42840760946273804 |
| keywords[6].display_name | Calculus (dental) |
| keywords[7].id | https://openalex.org/keywords/programming-language |
| keywords[7].score | 0.41533416509628296 |
| keywords[7].display_name | Programming language |
| keywords[8].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[8].score | 0.39886003732681274 |
| keywords[8].display_name | Theoretical computer science |
| keywords[9].id | https://openalex.org/keywords/algebra-over-a-field |
| keywords[9].score | 0.39488279819488525 |
| keywords[9].display_name | Algebra over a field |
| keywords[10].id | https://openalex.org/keywords/mathematics |
| keywords[10].score | 0.24754378199577332 |
| keywords[10].display_name | Mathematics |
| keywords[11].id | https://openalex.org/keywords/database |
| keywords[11].score | 0.2035263180732727 |
| keywords[11].display_name | Database |
| keywords[12].id | https://openalex.org/keywords/pure-mathematics |
| keywords[12].score | 0.07817625999450684 |
| keywords[12].display_name | Pure mathematics |
| language | en |
| locations[0].id | doi:10.46298/lmcs-19(4:38)2023 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S114379355 |
| locations[0].source.issn | 1860-5974 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1860-5974 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Logical Methods in Computer Science |
| locations[0].source.host_organization | https://openalex.org/P4310313916 |
| locations[0].source.host_organization_name | Logical Methods in Computer Science e.V. |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310313916 |
| locations[0].source.host_organization_lineage_names | Logical Methods in Computer Science e.V. |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://lmcs.episciences.org/12737/pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Logical Methods in Computer Science |
| locations[0].landing_page_url | https://doi.org/10.46298/lmcs-19(4:38)2023 |
| locations[1].id | pmh:oai:doaj.org/article:8705315f0b46493d8d1b6d4ce8b1d075 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023) |
| locations[1].landing_page_url | https://doaj.org/article/8705315f0b46493d8d1b6d4ce8b1d075 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5020812040 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-3018-2557 |
| authorships[0].author.display_name | Martin Raszyk |
| authorships[0].countries | CH |
| authorships[0].affiliations[0].raw_affiliation_string | DFINITY, Zurich, Switzerland |
| authorships[0].affiliations[1].institution_ids | https://openalex.org/I35440088 |
| authorships[0].affiliations[1].raw_affiliation_string | Department of Computer Science, ETH Zürich, Zurich, Switzerland |
| authorships[0].institutions[0].id | https://openalex.org/I35440088 |
| authorships[0].institutions[0].ror | https://ror.org/05a28rw58 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I2799323385, https://openalex.org/I35440088 |
| authorships[0].institutions[0].country_code | CH |
| authorships[0].institutions[0].display_name | ETH Zurich |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Martin Raszyk |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | DFINITY, Zurich, Switzerland, Department of Computer Science, ETH Zürich, Zurich, Switzerland |
| authorships[1].author.id | https://openalex.org/A5025344654 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-2952-939X |
| authorships[1].author.display_name | David Basin |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | David Basin |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5028440299 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-8314-2589 |
| authorships[2].author.display_name | Srđan Krstić |
| authorships[2].countries | CH |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I35440088 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Computer Science, ETH Zürich, Zurich, Switzerland |
| authorships[2].institutions[0].id | https://openalex.org/I35440088 |
| authorships[2].institutions[0].ror | https://ror.org/05a28rw58 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I2799323385, https://openalex.org/I35440088 |
| authorships[2].institutions[0].country_code | CH |
| authorships[2].institutions[0].display_name | ETH Zurich |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Srđan Krstić |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Computer Science, ETH Zürich, Zurich, Switzerland |
| authorships[3].author.id | https://openalex.org/A5046106256 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-7982-2768 |
| authorships[3].author.display_name | Dmitriy Traytel |
| authorships[3].countries | DK |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I124055696 |
| authorships[3].affiliations[0].raw_affiliation_string | Department of Computer Science, University of Copenhagen, Copenhagen, Denmark |
| authorships[3].institutions[0].id | https://openalex.org/I124055696 |
| authorships[3].institutions[0].ror | https://ror.org/035b05819 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I124055696 |
| authorships[3].institutions[0].country_code | DK |
| authorships[3].institutions[0].display_name | University of Copenhagen |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Dmitriy Traytel |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Department of Computer Science, University of Copenhagen, Copenhagen, Denmark |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://lmcs.episciences.org/12737/pdf |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Efficient Evaluation of Arbitrary Relational Calculus Queries |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10317 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9994999766349792 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Advanced Database Systems and Queries |
| 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 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.46298/lmcs-19(4:38)2023 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S114379355 |
| best_oa_location.source.issn | 1860-5974 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1860-5974 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Logical Methods in Computer Science |
| best_oa_location.source.host_organization | https://openalex.org/P4310313916 |
| best_oa_location.source.host_organization_name | Logical Methods in Computer Science e.V. |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310313916 |
| best_oa_location.source.host_organization_lineage_names | Logical Methods in Computer Science e.V. |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://lmcs.episciences.org/12737/pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Logical Methods in Computer Science |
| best_oa_location.landing_page_url | https://doi.org/10.46298/lmcs-19(4:38)2023 |
| primary_location.id | doi:10.46298/lmcs-19(4:38)2023 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S114379355 |
| primary_location.source.issn | 1860-5974 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1860-5974 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Logical Methods in Computer Science |
| primary_location.source.host_organization | https://openalex.org/P4310313916 |
| primary_location.source.host_organization_name | Logical Methods in Computer Science e.V. |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310313916 |
| primary_location.source.host_organization_lineage_names | Logical Methods in Computer Science e.V. |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://lmcs.episciences.org/12737/pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Logical Methods in Computer Science |
| primary_location.landing_page_url | https://doi.org/10.46298/lmcs-19(4:38)2023 |
| publication_date | 2023-12-22 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W2143210706, https://openalex.org/W1966217515, https://openalex.org/W2267240189, https://openalex.org/W2031856459, https://openalex.org/W2122719199, https://openalex.org/W297262571, https://openalex.org/W1524668325, https://openalex.org/W2005440900, https://openalex.org/W2004648467, https://openalex.org/W2027639996, https://openalex.org/W2065603413, https://openalex.org/W1990748731, https://openalex.org/W15008848, https://openalex.org/W2963560792, https://openalex.org/W1489366126, https://openalex.org/W1751719170, https://openalex.org/W2149675716, https://openalex.org/W2971196067, https://openalex.org/W2161956202, https://openalex.org/W2536131596, https://openalex.org/W2120127771, https://openalex.org/W4412280681, https://openalex.org/W1532667386, https://openalex.org/W4244028915, https://openalex.org/W2112512808, https://openalex.org/W1989783863, https://openalex.org/W2106716639, https://openalex.org/W4206031975 |
| referenced_works_count | 28 |
| abstract_inverted_index.a | 5, 35, 83, 91 |
| abstract_inverted_index.RC | 12, 41, 137 |
| abstract_inverted_index.We | 33, 110, 139 |
| abstract_inverted_index.an | 39, 59 |
| abstract_inverted_index.if | 104 |
| abstract_inverted_index.in | 29, 156 |
| abstract_inverted_index.is | 4, 56, 71, 98, 107 |
| abstract_inverted_index.of | 38, 51 |
| abstract_inverted_index.on | 25 |
| abstract_inverted_index.to | 90, 100, 119, 128, 134 |
| abstract_inverted_index.us | 127 |
| abstract_inverted_index.we | 152 |
| abstract_inverted_index.SQL | 123 |
| abstract_inverted_index.The | 0, 69, 94 |
| abstract_inverted_index.and | 18, 73, 159 |
| abstract_inverted_index.are | 16 |
| abstract_inverted_index.for | 47 |
| abstract_inverted_index.new | 36 |
| abstract_inverted_index.our | 112, 142 |
| abstract_inverted_index.the | 49, 52, 62, 66, 75, 86, 101, 105, 145 |
| abstract_inverted_index.two | 44, 63, 122 |
| abstract_inverted_index.use | 129 |
| abstract_inverted_index.(RC) | 3 |
| abstract_inverted_index.This | 125 |
| abstract_inverted_index.also | 153 |
| abstract_inverted_index.both | 157 |
| abstract_inverted_index.from | 21 |
| abstract_inverted_index.have | 65 |
| abstract_inverted_index.into | 43 |
| abstract_inverted_index.more | 116 |
| abstract_inverted_index.ones | 118 |
| abstract_inverted_index.over | 148 |
| abstract_inverted_index.show | 140 |
| abstract_inverted_index.that | 141 |
| abstract_inverted_index.time | 146 |
| abstract_inverted_index.used | 28 |
| abstract_inverted_index.with | 114 |
| abstract_inverted_index.based | 24 |
| abstract_inverted_index.first | 70 |
| abstract_inverted_index.fixed | 84 |
| abstract_inverted_index.given | 82 |
| abstract_inverted_index.i.e., | 80 |
| abstract_inverted_index.often | 19 |
| abstract_inverted_index.query | 8, 13, 42, 88, 97 |
| abstract_inverted_index.safe. | 109 |
| abstract_inverted_index.which | 48, 151 |
| abstract_inverted_index.allows | 126 |
| abstract_inverted_index.closed | 72 |
| abstract_inverted_index.devise | 34 |
| abstract_inverted_index.finite | 26, 92 |
| abstract_inverted_index.latter | 106 |
| abstract_inverted_index.obtain | 121 |
| abstract_inverted_index.other, | 115 |
| abstract_inverted_index.query, | 103 |
| abstract_inverted_index.result | 55 |
| abstract_inverted_index.second | 95 |
| abstract_inverted_index.tables | 27 |
| abstract_inverted_index.compose | 111 |
| abstract_inverted_index.confirm | 155 |
| abstract_inverted_index.deviate | 20 |
| abstract_inverted_index.domain, | 61 |
| abstract_inverted_index.queries | 64 |
| abstract_inverted_index.query's | 53, 77 |
| abstract_inverted_index.safety, | 79 |
| abstract_inverted_index.systems | 133 |
| abstract_inverted_index.whether | 81 |
| abstract_inverted_index.Assuming | 58 |
| abstract_inverted_index.However, | 10 |
| abstract_inverted_index.calculus | 2 |
| abstract_inverted_index.concise, | 6 |
| abstract_inverted_index.database | 30, 131 |
| abstract_inverted_index.evaluate | 135 |
| abstract_inverted_index.existing | 11, 149 |
| abstract_inverted_index.improves | 144 |
| abstract_inverted_index.infinite | 60 |
| abstract_inverted_index.meaning: | 68 |
| abstract_inverted_index.original | 76, 87, 102 |
| abstract_inverted_index.queries, | 46 |
| abstract_inverted_index.queries. | 124, 138 |
| abstract_inverted_index.relative | 78 |
| abstract_inverted_index.standard | 117, 130 |
| abstract_inverted_index.systems. | 32 |
| abstract_inverted_index.arbitrary | 40, 136 |
| abstract_inverted_index.database, | 85 |
| abstract_inverted_index.evaluates | 89 |
| abstract_inverted_index.following | 67 |
| abstract_inverted_index.language. | 9 |
| abstract_inverted_index.realistic | 158 |
| abstract_inverted_index.relation. | 93 |
| abstract_inverted_index.synthetic | 160 |
| abstract_inverted_index.algorithms | 23 |
| abstract_inverted_index.approaches | 15 |
| abstract_inverted_index.complexity | 147 |
| abstract_inverted_index.equivalent | 99 |
| abstract_inverted_index.evaluation | 14, 54 |
| abstract_inverted_index.finiteness | 50 |
| abstract_inverted_index.management | 31, 132 |
| abstract_inverted_index.relational | 1 |
| abstract_inverted_index.relatively | 108 |
| abstract_inverted_index.safe-range | 45, 96 |
| abstract_inverted_index.ultimately | 120 |
| abstract_inverted_index.approaches, | 150 |
| abstract_inverted_index.declarative | 7 |
| abstract_inverted_index.empirically | 154 |
| abstract_inverted_index.established | 22 |
| abstract_inverted_index.guaranteed. | 57 |
| abstract_inverted_index.inefficient | 17 |
| abstract_inverted_index.translation | 37, 113, 143 |
| abstract_inverted_index.experiments. | 161 |
| abstract_inverted_index.characterizes | 74 |
| cited_by_percentile_year.max | 95 |
| cited_by_percentile_year.min | 91 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.6899999976158142 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.56917147 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |