Efficient Evaluation of Arbitrary Relational Calulus Queries Article Swipe
Martin Raszyk
,
David Basin
,
Srđan Krstić
,
Dmitriy Traytel
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.3929/ethz-b-000651890
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.3929/ethz-b-000651890
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
Computer science
SQL
Query optimization
Query language
Sargable
Relational database
Range (aeronautics)
View
Conjunctive query
Relational calculus
Query expansion
Relation (database)
Relational model
Query by Example
Theoretical computer science
Database
Web search query
Information retrieval
Database design
Search engine
Composite material
Materials science
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://hdl.handle.net/20.500.11850/651890
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4306891375
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4306891375Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3929/ethz-b-000651890Digital Object Identifier
- Title
-
Efficient Evaluation of Arbitrary Relational Calulus QueriesWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-01-01Full publication date if available
- Authors
-
Martin Raszyk, David Basin, Srđan Krstić, Dmitriy TraytelList of authors in order
- Landing page
-
https://hdl.handle.net/20.500.11850/651890Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hdl.handle.net/20.500.11850/651890Direct OA link when available
- Concepts
-
Computer science, SQL, Query optimization, Query language, Sargable, Relational database, Range (aeronautics), View, Conjunctive query, Relational calculus, Query expansion, Relation (database), Relational model, Query by Example, Theoretical computer science, Database, Web search query, Information retrieval, Database design, Search engine, Composite material, Materials scienceTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4306891375 |
|---|---|
| doi | https://doi.org/10.3929/ethz-b-000651890 |
| ids.doi | https://doi.org/10.3929/ethz-b-000651890 |
| ids.openalex | https://openalex.org/W4306891375 |
| fwci | 0.0 |
| type | preprint |
| title | Efficient Evaluation of Arbitrary Relational Calulus Queries |
| biblio.issue | |
| biblio.volume | |
| 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.9994000196456909 |
| 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/T10679 |
| 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 | Service-Oriented Architecture and Web Services |
| topics[2].id | https://openalex.org/T10215 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9973999857902527 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Semantic Web and Ontologies |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.744775652885437 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C510870499 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6560394167900085 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q47607 |
| concepts[1].display_name | SQL |
| concepts[2].id | https://openalex.org/C157692150 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6426081657409668 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2919848 |
| concepts[2].display_name | Query optimization |
| concepts[3].id | https://openalex.org/C192028432 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6332591772079468 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q845739 |
| concepts[3].display_name | Query language |
| concepts[4].id | https://openalex.org/C192939062 |
| concepts[4].level | 4 |
| concepts[4].score | 0.6329132318496704 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q104840822 |
| concepts[4].display_name | Sargable |
| concepts[5].id | https://openalex.org/C5655090 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5588697195053101 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q192588 |
| concepts[5].display_name | Relational database |
| concepts[6].id | https://openalex.org/C204323151 |
| concepts[6].level | 2 |
| concepts[6].score | 0.533002495765686 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q905424 |
| concepts[6].display_name | Range (aeronautics) |
| concepts[7].id | https://openalex.org/C54239708 |
| concepts[7].level | 3 |
| concepts[7].score | 0.5172082185745239 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1329910 |
| concepts[7].display_name | View |
| concepts[8].id | https://openalex.org/C65647387 |
| concepts[8].level | 3 |
| concepts[8].score | 0.5118605494499207 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1781706 |
| concepts[8].display_name | Conjunctive query |
| concepts[9].id | https://openalex.org/C99436015 |
| concepts[9].level | 4 |
| concepts[9].score | 0.46850210428237915 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1722436 |
| concepts[9].display_name | Relational calculus |
| concepts[10].id | https://openalex.org/C99016210 |
| concepts[10].level | 2 |
| concepts[10].score | 0.44195595383644104 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q5488129 |
| concepts[10].display_name | Query expansion |
| concepts[11].id | https://openalex.org/C25343380 |
| concepts[11].level | 2 |
| concepts[11].score | 0.4388187825679779 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q277521 |
| concepts[11].display_name | Relation (database) |
| concepts[12].id | https://openalex.org/C40207289 |
| concepts[12].level | 3 |
| concepts[12].score | 0.4371389150619507 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q755662 |
| concepts[12].display_name | Relational model |
| concepts[13].id | https://openalex.org/C194222762 |
| concepts[13].level | 4 |
| concepts[13].score | 0.41459235548973083 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q114486 |
| concepts[13].display_name | Query by Example |
| concepts[14].id | https://openalex.org/C80444323 |
| concepts[14].level | 1 |
| concepts[14].score | 0.39028042554855347 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[14].display_name | Theoretical computer science |
| concepts[15].id | https://openalex.org/C77088390 |
| concepts[15].level | 1 |
| concepts[15].score | 0.3174159526824951 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[15].display_name | Database |
| concepts[16].id | https://openalex.org/C164120249 |
| concepts[16].level | 3 |
| concepts[16].score | 0.29680970311164856 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q995982 |
| concepts[16].display_name | Web search query |
| concepts[17].id | https://openalex.org/C23123220 |
| concepts[17].level | 1 |
| concepts[17].score | 0.27444708347320557 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q816826 |
| concepts[17].display_name | Information retrieval |
| concepts[18].id | https://openalex.org/C148840519 |
| concepts[18].level | 2 |
| concepts[18].score | 0.1862477958202362 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q1049878 |
| concepts[18].display_name | Database design |
| concepts[19].id | https://openalex.org/C97854310 |
| concepts[19].level | 2 |
| concepts[19].score | 0.0807698667049408 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q19541 |
| concepts[19].display_name | Search engine |
| concepts[20].id | https://openalex.org/C159985019 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q181790 |
| concepts[20].display_name | Composite material |
| concepts[21].id | https://openalex.org/C192562407 |
| concepts[21].level | 0 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q228736 |
| concepts[21].display_name | Materials science |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.744775652885437 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/sql |
| keywords[1].score | 0.6560394167900085 |
| keywords[1].display_name | SQL |
| keywords[2].id | https://openalex.org/keywords/query-optimization |
| keywords[2].score | 0.6426081657409668 |
| keywords[2].display_name | Query optimization |
| keywords[3].id | https://openalex.org/keywords/query-language |
| keywords[3].score | 0.6332591772079468 |
| keywords[3].display_name | Query language |
| keywords[4].id | https://openalex.org/keywords/sargable |
| keywords[4].score | 0.6329132318496704 |
| keywords[4].display_name | Sargable |
| keywords[5].id | https://openalex.org/keywords/relational-database |
| keywords[5].score | 0.5588697195053101 |
| keywords[5].display_name | Relational database |
| keywords[6].id | https://openalex.org/keywords/range |
| keywords[6].score | 0.533002495765686 |
| keywords[6].display_name | Range (aeronautics) |
| keywords[7].id | https://openalex.org/keywords/view |
| keywords[7].score | 0.5172082185745239 |
| keywords[7].display_name | View |
| keywords[8].id | https://openalex.org/keywords/conjunctive-query |
| keywords[8].score | 0.5118605494499207 |
| keywords[8].display_name | Conjunctive query |
| keywords[9].id | https://openalex.org/keywords/relational-calculus |
| keywords[9].score | 0.46850210428237915 |
| keywords[9].display_name | Relational calculus |
| keywords[10].id | https://openalex.org/keywords/query-expansion |
| keywords[10].score | 0.44195595383644104 |
| keywords[10].display_name | Query expansion |
| keywords[11].id | https://openalex.org/keywords/relation |
| keywords[11].score | 0.4388187825679779 |
| keywords[11].display_name | Relation (database) |
| keywords[12].id | https://openalex.org/keywords/relational-model |
| keywords[12].score | 0.4371389150619507 |
| keywords[12].display_name | Relational model |
| keywords[13].id | https://openalex.org/keywords/query-by-example |
| keywords[13].score | 0.41459235548973083 |
| keywords[13].display_name | Query by Example |
| keywords[14].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[14].score | 0.39028042554855347 |
| keywords[14].display_name | Theoretical computer science |
| keywords[15].id | https://openalex.org/keywords/database |
| keywords[15].score | 0.3174159526824951 |
| keywords[15].display_name | Database |
| keywords[16].id | https://openalex.org/keywords/web-search-query |
| keywords[16].score | 0.29680970311164856 |
| keywords[16].display_name | Web search query |
| keywords[17].id | https://openalex.org/keywords/information-retrieval |
| keywords[17].score | 0.27444708347320557 |
| keywords[17].display_name | Information retrieval |
| keywords[18].id | https://openalex.org/keywords/database-design |
| keywords[18].score | 0.1862477958202362 |
| keywords[18].display_name | Database design |
| keywords[19].id | https://openalex.org/keywords/search-engine |
| keywords[19].score | 0.0807698667049408 |
| keywords[19].display_name | Search engine |
| language | en |
| locations[0].id | pmh:oai:www.research-collection.ethz.ch:20.500.11850/651890 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402302 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Repository for Publications and Research Data (ETH Zurich) |
| locations[0].source.host_organization | https://openalex.org/I35440088 |
| locations[0].source.host_organization_name | ETH Zurich |
| locations[0].source.host_organization_lineage | https://openalex.org/I35440088 |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | info:eu-repo/semantics/publishedVersion |
| 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, 19 (4) |
| locations[0].landing_page_url | http://hdl.handle.net/20.500.11850/651890 |
| locations[1].id | pmh:oai:arXiv.org:2210.09964 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | https://arxiv.org/pdf/2210.09964 |
| locations[1].version | submittedVersion |
| locations[1].raw_type | text |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://arxiv.org/abs/2210.09964 |
| locations[2].id | doi:10.48550/arxiv.2210.09964 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400194 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | True |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | arXiv (Cornell University) |
| locations[2].source.host_organization | https://openalex.org/I205783295 |
| locations[2].source.host_organization_name | Cornell University |
| locations[2].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | |
| locations[2].raw_type | article-journal |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | |
| locations[2].raw_source_name | |
| locations[2].landing_page_url | https://doi.org/10.48550/arxiv.2210.09964 |
| locations[3].id | doi:10.3929/ethz-b-000651890 |
| locations[3].is_oa | True |
| locations[3].source.id | https://openalex.org/S7407051236 |
| locations[3].source.type | repository |
| locations[3].source.is_oa | False |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | ETH Zürich Research Collection |
| locations[3].source.host_organization | |
| locations[3].source.host_organization_name | |
| locations[3].license | |
| locations[3].pdf_url | |
| locations[3].version | |
| locations[3].raw_type | article-journal |
| locations[3].license_id | |
| locations[3].is_accepted | False |
| locations[3].is_published | |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://doi.org/10.3929/ethz-b-000651890 |
| indexed_in | arxiv, datacite |
| 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].author_position | first |
| authorships[0].raw_author_name | Raszyk, Martin |
| authorships[0].is_corresponding | False |
| 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 | Basin, David |
| 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].author_position | middle |
| authorships[2].raw_author_name | Krstić, Srđan |
| authorships[2].is_corresponding | False |
| 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].author_position | last |
| authorships[3].raw_author_name | Traytel, Dmitriy |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://hdl.handle.net/20.500.11850/651890 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Efficient Evaluation of Arbitrary Relational Calulus Queries |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| 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.9994000196456909 |
| 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/W2089781037, https://openalex.org/W2243465518, https://openalex.org/W1992658322, https://openalex.org/W3174970460, https://openalex.org/W206482712, https://openalex.org/W79051208, https://openalex.org/W2397160827, https://openalex.org/W176014370, https://openalex.org/W1842425231 |
| cited_by_count | 0 |
| locations_count | 4 |
| best_oa_location.id | pmh:oai:www.research-collection.ethz.ch:20.500.11850/651890 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402302 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Repository for Publications and Research Data (ETH Zurich) |
| best_oa_location.source.host_organization | https://openalex.org/I35440088 |
| best_oa_location.source.host_organization_name | ETH Zurich |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I35440088 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | info:eu-repo/semantics/publishedVersion |
| 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, 19 (4) |
| best_oa_location.landing_page_url | http://hdl.handle.net/20.500.11850/651890 |
| primary_location.id | pmh:oai:www.research-collection.ethz.ch:20.500.11850/651890 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402302 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Repository for Publications and Research Data (ETH Zurich) |
| primary_location.source.host_organization | https://openalex.org/I35440088 |
| primary_location.source.host_organization_name | ETH Zurich |
| primary_location.source.host_organization_lineage | https://openalex.org/I35440088 |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | info:eu-repo/semantics/publishedVersion |
| 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, 19 (4) |
| primary_location.landing_page_url | http://hdl.handle.net/20.500.11850/651890 |
| publication_date | 2023-01-01 |
| publication_year | 2023 |
| referenced_works_count | 0 |
| 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 | |
| countries_distinct_count | 0 |
| 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.00368081 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |