Reactive Relational Algebra
The author explores reactive relational algebra to enhance spreadsheet functionalities, using a time-indexed approach for asynchronous operations and self-referential tables for memory management, inviting feedback on their findings.
Read original article
The author reflects on their exploration of reactive relational algebra, expressing a sense of skepticism about its origins in computer science. They are attempting to create improved spreadsheet functionalities by utilizing derived tables akin to database views, particularly focusing on asynchronous data operations. The author introduces a time-indexed approach inspired by functional reactive programming, aiming to model concurrent asynchronous database operations. They find that using self-referential tables simplifies the process of managing memory in their async spreadsheets. The author shares their findings on self-unioning and self-intersecting sets, noting that these operations intuitively lead to predictable outcomes. They also highlight the expressive power of relational algebra, demonstrating how it can be used to derive specific records from datasets. The author concludes their exploration of reactive relational algebra, inviting feedback and ideas for future developments.
- The author is exploring reactive relational algebra to enhance spreadsheet functionalities.
- They utilize a time-indexed approach to model asynchronous database operations.
- Self-referential tables are used to simplify memory management in async spreadsheets.
- The author emphasizes the intuitive nature of self-unioning and self-intersecting sets.
- They invite feedback on their findings and future directions in this area.
Related
Distributed == Relational
The article explores how distributed systems can utilize relational database principles, advocating for parallel data gathering, triggers for function invocations, and user-friendly alternatives to SQL for efficient software development.
Growing the Graveyard of "Better Spreadsheets"
The article discusses the evolution of spreadsheets, their limitations, and introduces "scrapsheets," a new approach with advanced features like arrays and asynchronous operations, aiming to improve data handling.
- Several commenters recommend related works, such as "Dedalus: Datalog in Time and Space" and differential data flow, indicating interest in similar concepts.
- There are critiques regarding the practical implications of the proposed methods, particularly concerning asynchronous operations and their relationship with traditional database systems.
- Some users express appreciation for the blog's approach to engineering decisions, valuing real-time discussions over polished content.
- Concerns are raised about the technical aspects of the implementation, including the timing of resulting views and the nature of HTTP requests.
- Overall, the comments highlight a blend of curiosity, critique, and suggestions for further reading in the realm of reactive programming and relational algebra.
10 commentsMost people discover it through Electric Clojure.[1]
The Missionary author has some really good talks he's done up on YouTube about it.
Substantively, I don’t have much to say other than building math into the core of innovative programs should be a more common practice than it is. Not necessarily as a part of the code, but rather the design, documentation, and sometimes even the user copy. Math has stood the test of time (200y +/- 10,000y) for good reason!
Related
Distributed == Relational
The article explores how distributed systems can utilize relational database principles, advocating for parallel data gathering, triggers for function invocations, and user-friendly alternatives to SQL for efficient software development.
Growing the Graveyard of "Better Spreadsheets"
The article discusses the evolution of spreadsheets, their limitations, and introduces "scrapsheets," a new approach with advanced features like arrays and asynchronous operations, aiming to improve data handling.