this post was submitted on 17 May 2024
65 points (100.0% liked)

Data Structures and Algorithms

165 readers
1 users here now

A community dedicated to topics related to data structures and algorithms.

founded 7 months ago
MODERATORS
lysdexic@programming.dev
65
Computer Scientists Invent an Efficient New Way to Count (www.quantamagazine.org)
submitted 5 months ago by neme@lemm.ee to c/data_structures@programming.dev
8 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[โ€“] southernbrewer@lemmy.world 2 points 5 months ago (1 children)

So this is probably useful for statistics collectors in DBMSes, used for planning queries. Any other use cases jump to mind?

[โ€“] porgamrer@programming.dev 2 points 5 months ago

I thought it sounded kind of similar to statistical CPU profiling, where you're sampling the program counter of a given thread to see which functions actually use the most time. Maybe this idea could help increase the sample rate.