refset

33 ms·

391.
by refset 4y ago
One of these Postgres-based implementations of SQL:2011's temporal versioning might get you close enough: - https://github.com/nearform/temporal_tables - https://github.com/xocolatl/periods -
392.
by refset 4y ago
Maybe it's because Clojure has typically attracted a demographic who are more shy about self-promoting and marketing their new ideas and tools. Photon is an exciting (and relevant) example defying that trend though: https://
393.
by refset 4y ago
Agreed! For example in DataScript's Datalog: https://github.com/tonsky/datascript/blob/4f1af628d5650e0ca0...
394.
by refset 4y ago
CORFU and Tango are interesting research implementations in this general area, with emphasis on a dedicated "sequencer" - see https://rebeccabilbro.github.io/the-shared-log-abstraction/ Facebook's LogDev
395.
by refset 5y ago
He described this distancing from the methodology, and consequently what he considered the salient message, in a preface for a later printing of the book [0]: > Today, almost ten years after I wrote this book, one idea stands out clearly
396.
by refset 5y ago
Also reminiscent of Stephen Wolfram's recent thinking about the "Ruliad"[0], which I initially heard him discussing during the keynote at the recent re:Clojure conference: https://www.youtube.com/watch?v=FzbWA
397.
by refset 5y ago
RDFox [0] is a commercial system with "Parallel Datalog Materialisation" [1] [0] https://www.oxfordsemantic.tech/product [1] http://www.cs.ox.ac.uk/dan.olteanu/papers/mnpho-aaai14.pdf
398.
by refset 5y ago
> Automatic versioning of data More specifically, I would argue for the ability to run arbitrarily complex, non-locking, fully-consistent queries against all historic versions of the database, a.k.a. "the database as a value" (
399.
Clojure Radar 2021(juxt.pro)
5 points by refset 5y ago|0 comments
400.
by refset 5y ago
> bitemporal indexes [...] Can't you find an open source library that implements this? Undoubtedly too late for you, but https://github.com/juxt/crux/blob/master/crux-core/src/crux/
401.
by refset 5y ago
I somehow messed up the copy+paste and lost the last character, sorry :( Thank you for your persistence though and for chiming in with the right answer!
402.
by refset 5y ago
Pat also wrote a pretty great follow-up article that expands on the "Data on the Outside vs. Data on the Inside" section, covering the intersection of immutability, temporality, schema and relational querying: https://q
403.
by refset 5y ago
Not exactly plug and play, but for BigQuery there's now Logica https://opensource.googleblog.com/2021/04/logica-organizing-...
404.
by refset 5y ago
No need to apologise at all, and thank you for your thoughtful reply! > To get the full value out of it, your app code should be aware of transactions, participate in database mechanisms (versionstamps), correctly handle asynchronous str
405.
by refset 5y ago
Hi, I work on the Crux team. I think "fully distributed" has a few possible meanings, but is it essentially a case of wanting something with a dead-simple clustering story? Or is it more about multi-region distribution & avail
406.
by refset 5y ago
> even that might not be true It's not. For example, see SAP HANA's "Timeline Index" https://websci.informatik.uni-freiburg.de/publications/sigmo...
407.
by refset 5y ago
Disclosing benchmark results is forbidden by the licensing, which isn't uncommon for proprietary DBs, e.g. https://stackoverflow.com/questions/12115397/is-it-against-l... Incidentally, I was writing up some n
408.
by refset 5y ago
I work on Crux so can share a few details about our implementation of Datalog. The query is compiled into a kind of Worst-Case Optimal Join algorithm [0] which means that certain types of queries (e.g. cyclic graph-analytical queries, like
409.
by refset 5y ago
Crux timestamps sit outside of the data model and apply universally across the whole database (the data model is documents not tables), so you don't have to consciously think about managing bitemporality at all by default, but whenever
410.
by refset 5y ago
More specifically, retroactive data structures[0] are an interesting lens for thinking about bitemporality. After watching some great Erik Demaine lectures on temporal data structures I wrote a bit about the relationship to bitemporality on
411.
by refset 6y ago
"less power" definitely depends on what you value when comparing Git against real databases, e.g. https://stackoverflow.com/questions/984707/what-are-the-file... There is at least one database that exist
412.
by refset 6y ago
This is pretty interesting stuff, thanks for sharing! Does temporal information get any special treatment in the economic graph at the moment? Are temporal queries of any interest? I ask because I work on Crux [0] which at its core is a poi
413.
by refset 6y ago
:) well I already answered your same question on r/Clojure but here's a link for others: https://www.reddit.com/r/Clojure/comments/i3gzxy/crux_sql/g0...
414.
by refset 6y ago
1) availability of valid time for domain as-of queries 2) performance of ad hoc as-of queries 3) ingestion throughput (RocksDB is _fast_) 4) eviction/excision throughput 5) a lazy query engine doesn't demand so much memory (becaus
415.
by refset 6y ago
A thoroughly-validated canonical example problem hasn't emerged just yet, but there are many intersecting domains... Temporal graph analysis of "evolving graphs" is an active research field with some strong motivating use-cas
416.
by refset 6y ago
(I am involved with Crux - sorry!) I see 4 main reasons why someone may want to be aware of Crux: - if you have a bitemporal problem - if you have a graph problem, i.e. something you might initially look to Neo4j to help with - if you want
417.
by refset 6y ago
The context here is that we benchmark ourselves against the likes of Neo4j and RDF4J using SPARQL test suites, in particular WatDiv [0] and LUBM [1] which are specifically designed for stress testing various subgraph matching queries [2]. T
418.
by refset 6y ago
You always have the option to wire together multiple Datalog queries using Clojure/JVM-lang-of-choice (the N+1 query problem doesn't affect Crux when embedded), but we are currently analysing the possibilities for a higher-level q
419.
by refset 6y ago
As it happens there was a comment on a related issue about Dremio support [0] (which also uses Calcite) where someone shared that they got a Dremio driver working. I was able to fork their driver and get Metabase working against Crux in tim
420.
by refset 6y ago
I'm not sure EATV/AETV could be used fully instead of EAVT/AEVT as you would then lose the ability to have efficient range seeks across values. I do agree though that scanning all historical values in EAVT/AEVT is unsati

More ›