lichtenberger

15 ms·

61.
Strategy Pattern in Go(rednafi.com)
2 points by lichtenberger 3y ago|0 comments
62.
Unlocking Kafka's Potential: Tackling Tail Latency with eBPF(blog.allegro.tech)
4 points by lichtenberger 3y ago|0 comments
63.
Finding memory leaks in Postgres C code(enterprisedb.com)
106 points by lichtenberger 3y ago|19 comments
64.
Notes on debugging HotSpot's JIT compilation (2023)(jornvernee.github.io)
59 points by lichtenberger 3y ago|32 comments
65.
Bending pause times to your will with Generational ZGC(netflixtechblog.com)
85 points by lichtenberger 3y ago|29 comments
66.
Java: Update on String Templates (JEP 459)(mail.openjdk.org)
4 points by lichtenberger 3y ago|1 comments
67.
Heads-Up: Virtual Threads "Pinning" Issue(inside.java)
2 points by lichtenberger 3y ago|0 comments
68.
Improve Java Startup Time: JEP Draft: (Draft) Method Profiles in CDs Archives(openjdk.org)
1 points by lichtenberger 3y ago|0 comments
69.
1 Billion Row Challenge Top Contenders(twitch.tv)
1 points by lichtenberger 3y ago|0 comments
70.
Libraries: A First Step Toward Standard C++ Dependency Management [video](youtube.com)
1 points by lichtenberger 3y ago|0 comments
71.
Quality Outreach: Deprecate Memory-Access Methods in Sun.misc.Unsafe for Removal(inside.java)
1 points by lichtenberger 3y ago|0 comments
72.
by lichtenberger 3y ago
We're using a similar trie structure as the main document (node) index in SirixDB[1]. Lately, I got some inspiration for different page-sizes based on the ART and HAMT basically for the rightmost inner pages (as the node-IDs are genera
73.
LittleFS Design (CObW) – Combining advantages of COW and log-structures(github.com)
4 points by lichtenberger 3y ago|0 comments
74.
by lichtenberger 3y ago
The technique is also described in the awesome book "Crafting Interpreters" by Robert Nystrom.
75.
LittleFS Design(github.com)
3 points by lichtenberger 3y ago|1 comments
76.
by lichtenberger 3y ago
Super interesting read about COW, log-structures and a mix thereof (CObW -- copy on bounded writes).
77.
Back to Basics: Move Semantics – Nicolai Josuttis – CppCon 2021 [video](youtube.com)
2 points by lichtenberger 3y ago|0 comments
78.
JEP 455: Primitive Types in Patterns, instanceof, and switch (Preview)(openjdk.org)
1 points by lichtenberger 3y ago|0 comments
79.
Kandy: The new Kotlin plotting library by JetBrains(blog.jetbrains.com)
2 points by lichtenberger 3y ago|0 comments
80.
by lichtenberger 3y ago
I think it depends, but I wonder if anything can be done about the problem with checked exceptions in lambdas / for instance the streams. I think the enhanced switch with handling failure is only part of the solution, but I'm also
81.
Uniform Handling of Failure in Switch(inside.java)
20 points by lichtenberger 3y ago|6 comments
82.
Kotlin 2.0.0 Beta 2(github.com)
2 points by lichtenberger 3y ago|0 comments
83.
by lichtenberger 3y ago
At least they are already discussing the next version.
84.
by lichtenberger 3y ago
Oh, seems also because of random in-place writes of the B-tree.
85.
From C to Java Code using Panama(mostlynerdless.de)
2 points by lichtenberger 3y ago|0 comments
86.
by lichtenberger 3y ago
Because it has to copy and write entire pages instead of only force a flush of log records due to a WAL?
87.
by lichtenberger 3y ago
What about storing the data and thus, the indexes in Kafka. Would it make sense? Let's say currently, I'm storing SirixDB resources in files. However, instead of offsets into a file the index pages could be stored in Kafka optiona
88.
by lichtenberger 3y ago
Well, it may be a B-tree, or an LSM-tree, a trie or whatever index structure suits... Also, of course you may have covering indexes.
89.
by lichtenberger 3y ago
"Database Design and Implementation" by Edward Sciore is also a very great read with a lot of examples written in Java (actually a small DBS). For actual research I'd recommend all stuff from Andy (Pavlo), Viktor Leis, Thors
90.
by lichtenberger 3y ago
It's fundamentally how SirixDB approaches this (basically also storing checksums) as also written in another reply :-) Every commit directly syncs the binary data to the durable storage (currently a file) and incrementally adds data. F

More ›