pybktree VS pyroscope

The BK-Tree, which allows fast querying of "close" matches, such as Hamming distance (number of bits different). http://blog.notdot.net/2007/4/Damn-Cool-Algorithms-Part-1-BK...

I wrote a Python library implementing them a number of years ago: https://github.com/benhoyt/pybktree

Alternatively a BK-tree might suit your needs https://github.com/benhoyt/pybktree/blob/master/pybktree.py

What do you mean? pyroscope.io was slow for you? or the blog?

Tries (or prefix trees).

We use them a lot at Pyroscope for compressing strings that have common prefixes. They are also used in databases (e.g indexes in Mongo) or file formats (e.g debug symbols in macOS/iOS Mach-O format are compressed using tries).

We have an article with some animations that go into details about tries in case anyone's interested [0].

[0] https://github.com/pyroscope-io/pyroscope/blob/main/docs/sto...

You could use continuous profiling with Pyroscope which uses async-profiler under the hood, but with the added functionality that you can add relevant tags to your VMs (example).

Java Flight Recorder (JFR) is a format for collecting diagnostic and profiling data from Java applications. A while back someone created an issue for Pyroscope , an open source continuous profiler written in Go, to support ingesting profiles in JFR format, but there were no existing parsers that were also written in Go.

This cloud version is actually a slimmed-down version of Pyroscope which is open source and so you can run it locally.

At Pyroscope (open source continuous profiling) we use flamegraphs extensively to visualize and analyze profiling data. However, one of the worst parts about using flamegraphs for analysis is that they are kind of annoying to share.