Rhizome Research

A short list of relevant research to Rhizome. It is in no way exhaustive.

Query Compilation & Processing

• Automatic Index Selection for Large-Scale Datalog Computation
• Compiling Data-Parallel Datalog
• Datalog and Recursive Query Processing
• Queries are easier than you thought (probably)
• Recursive Strategies for Answering Recursive Queries — The RQA/FQI Strategy

Top-Down vs Bottom-Up

A debate that has raged for literal decades:

• Bottom-Up Beats Top-Down for Datalog
• Precise Complexity Analysis for Efficient Datalog Queries

Differential

• DBSP: Automatic Incremental View Maintenance for Rich Query Languages
• Differential Dataflow
• DBSP Notes

Languages

• Bloom
• Boomerang: A bidirectional programming language for ad-hoc, textual data

Schemas & Interoperation

• Project Cambria: Translate your data with lenses

Consistency

• Berkley Orders of Magnitude
• Keeping CALM: When Distributed Consistency is Easy

Byzantine Fault Tolerance

• Making CRDTs Byzantine Fault Tolerant

CRDTs

• Keep CALM and CRDT On

Data Structures

• A Specialized B-tree for Concurrent Datalog Evaluation
• Hexastore: Sextuple Indexing for Semantic Web Data Management

Encryption

Searchable

• Dynamic Local Searchable Symmetric Encryption
• ESVSSE: Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption
• Efficient Dynamic Searchable Encryption with Forward Privacy under the Decent Leakage
• Eurus: Towards an Efficient Searchable Symmetric Encryption with Size Pattern Protection
• Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions
• Verifiable Dynamic Symmetric Searchable Encryption Optimality and Forward Security