eventreduce

6 ms·

1.
LocalStorage vs. IndexedDB vs. Cookies vs. OPFS vs. WASM-SQLite(rxdb.info)
3 points by eventreduce 2y ago|0 comments
2.
by eventreduce 5y ago
With real private fields you can make a minifier that minifies the fieldname/functionname which is not possible before.
3.
by eventreduce 5y ago
It has like 100 times more moving parts that can break.
4.
by eventreduce 5y ago
Because you can make good money by migrating the customers java project once each year.
5.
by eventreduce 5y ago
Most people do not "deserve" bed space because most sickness is selfmade. People smoke, drink and eat too much, so they all deserve to die?
6.
by eventreduce 5y ago
You should check out the event-reduce algorithm[1]. It scales in a different way on how it calculates new results based on old-Results+Event. So it can have some benefits over materialized views depending on the data size and how many clien
7.
by eventreduce 6y ago
It sounds like you did not read the READme. What you are describing is something that does scale up with more data but not with more requests. When you have an application where 1000s of users subscribe to different queries, your view-maint
8.
by eventreduce 6y ago
The difference is that with simple caching you have to run full queries again when the cache becomes invalidated. This is often expensive especially on write intensive data usages.
9.
by eventreduce 6y ago
I think the best example for why this is useful is described by david glasser at his talk about the oplog driver used in meteor.js https://www.youtube.com/watch?v=_dzX_LEbZyI
10.
by eventreduce 6y ago
All your assumptions are wrong. Please read the other comments here or at least the readme of the repository. I will happily answer all ongoing questions you have afterwards.
11.
by eventreduce 6y ago
No and I also do not want to "claim" something. Feel free to do your own tests.
12.
by eventreduce 6y ago
EventReduce is a simple algorithm. It does not care or affect how you handle propagation of writes or how you handle your events, transactions or conflicts. See it as a simple function that can do oldResults+event=newResults like shown in t
13.
by eventreduce 6y ago
I recommend the video "Real-Time Databases Explained: Why Meteor, RethinkDB, Parse & Firebase Don't Scale" https://www.youtube.com/watch?v=HiQgQ88AdYo
14.
by eventreduce 6y ago
EventReduce is an algorithm and not a database-wrapper. It will not care about your writes or if your database layer is a cluster and so also not affect them.
15.
by eventreduce 6y ago
I encourage you to read the readme and check out the demo. EventReduce is nothing magically drills out your database and affects the consistency of your write-accesses. It is a simple algorithm that is implemented as a function with two inp
16.
by eventreduce 6y ago
I understand that reading the plain source code is more painful then reading a paper. There are many different trade-offs between a paper and the current repository with source code. For me the biggest argument was that EventReduce is a per
17.
by eventreduce 6y ago
localStorage is no database, check out the demo page.
18.
by eventreduce 6y ago
You have to provide the events by yourself. See EventReduce as a simple function that can do oldResults+Event=newResults. And yes, you should always do testings before you use open source stuff. There is no warranty use it on your own risk.
19.
by eventreduce 6y ago
Yes I used it. I actually know it really well. I also did performance comparisons with mongodb and mongodbs change stream and cursors. What I posted here is just an algorithm. You could now compare it to mongodb (a product) and say it is a
20.
by eventreduce 6y ago
I think it is dangerous to propose a database product as a solution to the limitation of a simple algorithm.
21.
by eventreduce 6y ago
Thanks that looks interesting. I added it to my to-read list.
22.
by eventreduce 6y ago
The biggest usecase for EventReduce is realtime applications. Most technologies for these like Firebase, AWS AppSync etc. work on non-relational data. If you want to use EventReduce with relational queries, you have to make them non-relatio
23.
by eventreduce 6y ago
This is a great question. So EventReduce is only the algorithm that calculates your new results. The parsing of SQL is not done by it, you have to bring it by yourself. This works over providing some information about the query like Sort-fi
24.
by eventreduce 6y ago
There is a big difference between a change-stream and a realtime query. For example mongodbs cursor-stream is a good way to observe the events that happen to a specific collection or documents that match some criteria. If you want the realt
25.
by eventreduce 6y ago
The writes are not tunneled somehow through this algorithm. You still use the database like your normally would do. So the consistency is not affected. Also this is an open source project, not something I want to sell you. Feel free to make
26.
by eventreduce 6y ago
There is a big difference between a database with an event stream and a 'realtime query' that can be created with event reduce.
27.
by eventreduce 6y ago
Yes this is correct. The performance benefit comes from doing all this stuff on the CPU instead of using disc-io. Also the internal binary decision diagram of EventReduced is optimized in a way to run less logic then a query would do. This
28.
by eventreduce 6y ago
Not exactly. To use EventReduce you must have a changestream out of all writes to your data int the correct order. You can do that by wrapping a frontend over your database. But easier you do that by using a database that already provides a
29.
by eventreduce 6y ago
No it is explicitly not for append-only data. It works with inserts, updates and deletes. I think I have problems understanding what exactly you mean by the need for a logical clock. The algorithm is feeded with the old query results plus o
30.
by eventreduce 6y ago
I do not think this has many in common. Lambda is used for stream processing much data. EventReduce is used for optimizing the latency of much (repeating) queries.

More ›