akorotkov

6 ms·

1.
by akorotkov 3mo ago
We keep going. Planning GA till the end of this year. Only a couple of missing features left. The main focus is stability.
2.
by akorotkov 1y ago
Exclusion constraints should work well for this case. On any transaction isolation level. https://www.postgresql.org/docs/current/ddl-constraints.html...
3.
by akorotkov 1y ago
We will eventually add the SERIALIZABLE isolation level to OrioleDB, but right now that's not our highest priority. Let me explain why. At first, SSI (serializable snapshot isolation) in PostgreSQL comes with significant shortcomings
4.
by akorotkov 1y ago
Yep, regular PostgreSQL indexes point to a heap location (block number + offset). And it is the same for primary and secondary indexes.
5.
by akorotkov 1y ago
Thank you, that would be on the TODO list.
6.
by akorotkov 1y ago
This is generally true, but there are some additional aspects. 1. With PostgreSQL heap, you need to access the heap page itself. And it's not for free. It goes all through the buffer manager and other related components. 2. In OrioleDB
7.
by akorotkov 1y ago
Hey HN, I'm the creator of OrioleDB, an extension for PostgreSQL that serves as a drop-in replacement for the default Heap storage engine. It is designed to address scalability bottlenecks in PostgreSQL's buffer manager and reduce
8.
Ordered Insertion Optimization in OrioleDB(orioledb.com)
19 points by akorotkov 1y ago|1 comments
9.
by akorotkov 1y ago
We're planning to reach GA this year. Pushing all the patches to PostgreSQL core and making OrioleDB a pure extension will take more time.
10.
by akorotkov 1y ago
Currently, OrioleDB can use GIN indexes via index bridging mechanism. https://www.orioledb.com/blog/orioledb-bridged-indexes But more effective native analogues for GIN/RUN are in our roadmap.
11.
by akorotkov 1y ago
Hey HN, I'm the creator of OrioleDB, an extension for PostgreSQL that serves as a drop-in replacement for the default Heap storage engine. It is designed to address scalability bottlenecks in PostgreSQL's buffer manager and reduce
12.
OrioleDB fastpath search (faster random key lookups for PostgreSQL)(orioledb.com)
4 points by akorotkov 1y ago|1 comments
13.
by akorotkov 1y ago
Additionally, OrioleDB beta12 features a new fastpath tree search, which can accelerate workloads with intensive key-value lookups by up to 20%. Stay tuned for a new blog post about this later this week.
14.
Show HN: OrioleDB Beta12 Features and Benchmarks(orioledb.com)
55 points by akorotkov 1y ago|17 comments
15.
by akorotkov 1y ago
> That kind of exists thanks to NeonDB? This is unrelated to NeonDB. OrioleDB has been acquired by Supabase. https://supabase.com/blog/supabase-acquires-oriole
16.
by akorotkov 1y ago
> OrioleDB solve the vacuum problem with the introduction of the undo log. Way more than just this! > With some work you can run OrioleDB AND neon storage and get benefits of both. This would require significant design work, given tha
17.
Making Postgres Better with OrioleDB(misachi.github.io)
8 points by akorotkov 1y ago|1 comments
18.
by akorotkov 2y ago
That's also so cool we are getting externally validated! https://x.com/MinisterOfEng/status/1864793214282019065 My kudos to MinisterOfEng!
19.
by akorotkov 2y ago
> Additionally, PostgreSQL requires N^2 of memory depending on the number of connections, For sure, not all the PostgreSQL memory is N^2. AFAIR, just a couple of components, including deadlock decoding, require a quadratic amount of memo
20.
by akorotkov 2y ago
Thank you for your feedback! We tried to enable think time with go-tpc, thanks to @pashkinelfe. That leaves us with 1 tpmC per connection, growing linearly up to ~300 connections for both heap and OrioleDB. So, in order to experience a stor
21.
by akorotkov 2y ago
Thank you, your feedback is appreciated. The important design issue about building active-active multi-master on the base of raft protocol is about being able to apply changes locally without immediately putting them into a log (without sac
22.
by akorotkov 2y ago
Some notable benchmarks from the OrioleDB beta7 release: * 5.5x Faster at 500 Warehouses: In TPC-C benchmarks with 500 warehouses, OrioleDB outperformed PostgreSQL's default heap tables by 5.5 times. This highlights significant gains i
23.
by akorotkov 2y ago
This was driven by Andres Freund for pg12. Please, check this. https://anarazel.de/talks/2018-10-25-pgconfeu-pluggable-stor... However, the current table AM API in many aspects assumes heap-like storage. This is why
24.
by akorotkov 2y ago
Sure, there are downsides. 1. The replay of WAL records becomes somewhat more CPU-expensive. But at the same time, OrioleDB can do that in parallel. 2. Replace becomes not the file-level equivalent of primary. Thus, you, for instance, can&
25.
by akorotkov 2y ago
I'm happy to join the Supabase. Working in Supabase gives me a unique opportunity to find use cases for OrioleDB and scale up the development team. I'll be around to answer any technical questions.
26.
by akorotkov 3y ago
> Does the author have any info on how they plan to implement these more complex (but extremely useful) index methods? Regarding GiST analogue my plan is to build B-tree over some space-filling curve. Also, I'm planning to add union
27.
by akorotkov 3y ago
> - Row-level anything introduces write alignment and fsync alignment problems; pages are easier to align than arbitrary-sized rows OrioleDB uses row-level WAL, but still uses pages. The row-level WAL becomes possible thanks to copy-on-
28.
by akorotkov 3y ago
I'm seeing OrioleDB as a future engine for PostgreSQL. I'd like to see it as the default engine. However, the changes in OrioleDB are too big to be made incrementally. This is why I'm comparing the current PostgreSQL engine
29.
by akorotkov 3y ago
Please, check this. https://supabase.com/blog/postgres-pluggable-strorage https://www.pgcon.org/events/pgcon_2023/schedule/session/470... Pushing patches to PostgreSQL Core requires
30.
by akorotkov 3y ago
> E: I don't see in the article when rows get evicted from the undo logs. The undo records are truncated once they aren't needed for any transaction. > If when they are no longer needed, I'm not sure where the improveme

More ›