lsuresh

9 ms·

1. 61.▲
   by lsuresh 2y ago

   Thanks! Looks like that works. Here is the query I set up on try.feldera.com. CREATE TABLE foo (x INTEGER NOT NULL PRIMARY KEY) WITH ('materialized' = 'true') ; CREATE MATERIALIZED VIEW bar AS SELECT x FROM (SELEC
2. 62.▲
   by lsuresh 2y ago

   Thank you! The state Feldera maintains depends on the queries you write and the working set or windows you're computing over. Any time there are joins, distinct or non-linear aggregations, we need to maintain state as you've guess
3. 63.▲
   by lsuresh 2y ago

   Your intuition is correct. Incremental computation is fundamentally a time-space tradeoff. Depending on the views you write, you might end up maintaining large amounts of state. We've written about it here: https://www.felde
4. 64.▲
   by lsuresh 2y ago

   For incremental computation, Feldera is just way more powerful and general. It can evaluate arbitrarily sophisticated SQL programs incrementally (tables and deeply nested layers of views). For example, it can do rolling aggregates over join
5. 65.▲
   by lsuresh 2y ago

   Thanks!
6. 66.▲
   by lsuresh 2y ago

   (Feldera's CEO here) We are based on DBSP ( https://www.vldb.org/pvldb/vol16/p1601-budiu.pdf ) which is an evolution of DD. DBSP gives us an algorithm to take arbitrarily complex queries and generate an increme
7. 67.▲
   by lsuresh 2y ago

   Thanks for the kind words! (Feldera's CEO here) - We evaluate top-k queries incrementally and the nesting shouldn't be a problem for the engine (or it'd be a bug). If you have an example of a query, we can try it out at our e
8. 68.▲
   by lsuresh 2y ago

   Hi Nelkins. We do have a Rust crate you could consider using directly: https://docs.rs/dbsp/latest/dbsp/ . Our SQL compiler puts together a pipeline by generating a Rust program that uses this crate.
9. 69.▲
   by lsuresh 2y ago

   I assume by deterministic simulation you mean: use a harness wherein you can deterministically run specific executions of a distributed system (e.g., force specific event interleavings, failures etc?)? If so, yes it's more accessible.
10. 70.▲
    by lsuresh 2y ago

    Full-system verification is more powerful than unit tests. You can prove an implementation of a distributed system is free of entire classes of bugs, modulo your specification. The reason is that there is simply no way to practically write
11. 71.▲
    by lsuresh 2y ago

    We've used Verus to write formally verified Kubernetes controllers. Basically, we can prove liveness properties of the form "eventually, the controller will reconcile the cluster to the requested desired state". As you can im
12. 72.▲
    by lsuresh 3y ago

    Most researchers do not do their best work during their PhD, but after it. The PhD is simply the training you need for a research career. It's an easy path to disillusionment when PhD students don't realize this (often because adv
13. 73.▲
    by lsuresh 3y ago

    As a long time XMonad user who had to switch to a mac at a new job, I first used chunkwm and then yabai. Yabai's requirement to disable SIP was a problem, and so I finally switched to Amethyst a year ago and have been quite happy with
14. 74.▲
    by lsuresh 5y ago

    XMonad is the one thing I miss dearly from Linux since I had to switch to a Mac. With some effort, yabai [1] on Mac can approximate XMonad well enough (mainly, multiple workspaces, automatic tiling, focus follows mouse, and a few other key
15. 75.▲
    by lsuresh 5y ago

    It's being actively worked on [1, 2]. [1] https://github.com/openjdk/valhalla/ [2] https://mail.openjdk.java.net/pipermail/valhalla-dev/
16. 76.▲
    by lsuresh 5y ago

    Thank you for the kind words! Yes it could be applied to general problems as well. In fact, we used it once to plan a program committee meeting. The library (DCM) has no idea what problem setting its being used for, and has no semantic info
17. 77.▲
    by lsuresh 5y ago

    If you're interested in this topic, we're building a tool for building cluster manager components (like policy-based container schedulers) using constraint programming, where constraints are specified using SQL. Paper: https:&#x2
18. 78.▲
    by lsuresh 5y ago

    There are some domains like building cluster managers where having a relational view of the cluster state and being able to query/manipulate it declaratively has significant perks. See for example: https://www.usenix.org&#x
19. 79.▲
    by lsuresh 6y ago

    There's already GraalVM Wasm: https://www.graalvm.org/reference-manual/wasm/
20. 80.▲
    by lsuresh 6y ago

    How does it compare to JOOQ? https://github.com/jooq/jooq
21. 81.▲
    by lsuresh 6y ago

    The paper is from 2012, not 2016 (see https://dl.acm.org/doi/10.5555/2342821.2342823 )
22. 82.▲
    by lsuresh 7y ago

    The CP-SAT solver would be used for combinatorial optimization problems. These solvers are very different than the ones you'd use for planning problems a la PDDL.
23. 83.▲
    by lsuresh 7y ago

    Configuration management systems (I'm thinking Ansible, Puppet etc) are used to declaratively execute configuration tasks at fairly slow timescales. You wouldn't use them them to say, make 1000s of VM/pod placement decisions
24. 84.▲
    by lsuresh 7y ago

    Author here. Your Kubernetes configurations stay the same. This is a tool you'd use, for instance, to write the internals of Kubernetes like the scheduler.