karsinkk

Yes!! A UI widget that shows how far along on the prompt cache eviction timelines we are would be great.

" Combined with this only happening in a corner case (stale sessions) and the difficulty of reproducing the issue, it took us over a week to discover and confirm the root cause"

I don't know about others, but sessions that are idle > 1h are definitely not a corner case for me. I use Claude code for personal work and most of the time, I'm making it do a task which could say take ~10 to 15mins. Note that I spend a lot of time back and forth with the model planning this task first before I ask it to execute it. Once the execution starts, I usually step away for a coffee break (or) switch to Codex to work on some other project - follow similar planning and execution with it. There are very high chances that it takes me > 1h to come back to Claude.

Oracle 23ai also has a similar feature that "explodes" JSON into relational tables/columns for storage while still providing JSON based access API's : https://www.oracle.com/database/json-relational-duality/

I was going over some of the code in the core folder for concurrency, threading and compression, what surprised me is that there’s absolutely no comments whatsoever. Agree that unless there’s excellent documentation, open source maintenance might be challenging.

Having said that, this definitely does look to be an impressive feat of engineering!

This looks very impressive! As another commenter echoed, the code base is ~5million lines of C++ code, but almost no comments at all. Unless the documentation is excellent, maintenance/open source work is going to be difficult.

Does anyone know of a way to check the amount of lending done through Bank Term Funding Programme so far?

Lazy Adaptive Trees : https://dl.acm.org/doi/10.14778/1687627.1687669

It is a B-Tree where updates to the tree are buffered in the branch nodes and are propagated down to the leaf nodes at a later point in time.

A related article : https://voxeu.org/article/algorithmic-stablecoins-and-devalu...

While transforming the plan into vectors is interesting, I wish they'd gone into more detail about how the ML model prunes and filters the best plan. It is also not clear what attributes of a plan the corresponding vector encodes. I do not know much about Databloom, but it looks like this "Learning-Based Query Optimizer" is built for specific use-cases in a Data engineering/analytics setting(like K-means as cited in the article). It might not be a replacement for optimizers in traditional Databases.

Is there any reading material that you can share about the M1 scheduler?

This article just appears to quote most of the content from the original[1]. It'd be better if the original was in the front page instead.

[1] https://mymodernmet.com/ancient-egyptians-attendance-record/

The following article is one of my favorite primers on Character sets/Unicode : https://www.joelonsoftware.com/2003/10/08/the-absolute-minim...

I've noticed the same behavior with the recommendation engine from Reddit and Instagram as well. While they don't totally block providing feedback on recommended posts that I'm actually not interested in, the UI flow to submit the feedback is difficult/confusing enough that I've just stopped doing it altogether. Could this be because retraining whatever model that they've built is difficult/expensive with new feedback?

Richard Foote's Blogs have a lot of details about different types of Indexes that are available in Oracle : https://richardfoote.wordpress.com/category/index-internals/

This might be a tad unrelated to the original post, but the following article is one of my favorite primers on Character sets/Unicode :

https://www.joelonsoftware.com/2003/10/08/the-absolute-minim...

You're right, A hash function doesn't map to multiple values. Bloom filters and other probabilistic set membership DS's like Cuckoo filters instead use multiple hash functions to map one input to multiple output values. [1] The number of hash functions to use depends on the expected false positive probability rate, number of bits in the filter and the number of elements which will be inserted

[1] https://en.wikipedia.org/wiki/Bloom_filter#Algorithm_descrip...

I still haven't gotten my hands on the Beta yet, so I'm not sure how it's going to be deployed; But does anyone know if Copilot is going to be accessible through some online IDE (or) is it going to be through an extension for VS Code/other editors? If it's the latter, I hope the extension doesn't eat up all my CPU!

Is it just me or is anyone else having a tough time trying to wade through all the jargon to figure out what this is actually about?

Agreed. This feel more like an involuntary social experiment and it just uses up the Kernel maintainers bandwidth. Reviewing code is difficult, even more so when the committer is set out to introduce bad code in the first place.

Here's a clarification from the Researchers over at UMN[1].

They claim that none of the Bogus patches were merged to the Stable code line :

Once any maintainer of the community responds to the email,indicating “looks good”,we immediately point out the introduced bug and request them to not go ahead to apply the patch. At the same time, we point out the correct fixing of the bug and provide our proper patch. In all the three cases, maintainers explicitly acknowledged and confirmed to not move forward with the incorrect patches. This way, we ensure that the incorrect patches will not be adopted or committed into the Git tree of Linux.

I haven't been able to find out what the 3 patches which the reference are, but the discussions on Greg's UMN Revert patch [2] does indicate that some of the fixes have indeed been merged to Stable and are actually Bogus.

[1] https://www-users.cs.umn.edu/~kjlu/papers/clarifications-hc....

[2] https://lore.kernel.org/lkml/20210421130105.1226686-1-gregkh...

Disclaimer : I work for Oracle.

Aqua looks very similar to Oracle's Smart Scan, which is available on Exadata [1] [2].

[1] https://blogs.oracle.com/infrastructure/what-is-smart-scan

[2] https://blogs.oracle.com/smartscan-deep-dive/

The paper submitted to VLDB [1] has a table (Table 1) which lists the time complexity for the PGM Index and compares it with a Sorted Array, a B-Tree and another type of Data Aware/Learned Index - FITing-tree

[1] http://www.vldb.org/pvldb/vol13/p1162-ferragina.pdf

A Decentralized Government.

My thought exactly. But Google has built such a big moat that it'd be hard for any new player to take out any considerable market share from them.

Earlier discussion on this Topic : https://news.ycombinator.com/item?id=19083169

Disclaimer : I'm a Software Engineer at Oracle

In Oracle 21c and the Autonomous JSON Database, we introduced a new Native JSON Datatype with it's own Binary Storage format called OSON[1]. With OSON, you can perform partial updates on a json document. The added benefit is that this results in significantly lesser redo log size.

[1] https://blogs.oracle.com/jsondb/osonformat

This is the first paper in the industry to describe the implementation of a distributed Hybrid Transactional/Analytical Processing (HTAP) database.

Oracle's In-Memory option offers dual Row and Columnar storage for Hybrid Transactional/Analytical workloads. The paper describing the feature was published to VLDB in 2015 : https://dl.acm.org/doi/10.14778/2824032.2824061

I don't want to start a flame war, but what's wrong with PL/SQL?, I'm genuinely curious.

How does your product differ from (or) compare with Fusion by Zeta[1] ?, They look pretty much the same to me, but Zeta seems to cover more workflows.

[1] https://www.zeta.tech/fintech/

Autonomous JSON Database costs 30% less than comparable MongoDB Atlas configuration.

Autonomous JSON database gives you 2x throughput consistently across different workload types and collection sizes.

This is great!

The result is a no-compromise document database providing low latency CRUD operations and full ACID consistency.

The recent Jepsen report[1] highlights some of the major transaction consistency issues with MongoDB and why it might not be suitable for all workloads.

[1] http://jepsen.io/analyses/mongodb-4.2.6