Nemeski to Data Structures and Algorithms • 4 months agoComputer Scientists Invent an Efficient New Way to Countwww.quantamagazine.orgexternal-linkmessage-square8fedilinkarrow-up165arrow-down10cross-posted to: [email protected]
arrow-up165arrow-down1external-linkComputer Scientists Invent an Efficient New Way to Countwww.quantamagazine.orgNemeski to Data Structures and Algorithms • 4 months agomessage-square8fedilinkcross-posted to: [email protected]
minus-square@[email protected]linkfedilinkEnglish2•4 months agoSo this is probably useful for statistics collectors in DBMSes, used for planning queries. Any other use cases jump to mind?
minus-square@porgamrerlink2•4 months agoI 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.
So this is probably useful for statistics collectors in DBMSes, used for planning queries. Any other use cases jump to mind?
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.