querying for paths with top-n highest values
I've looked at the source, and I don't see this functionality, so without spending
so much time trying to figure out how the data sits on disk, is there any easy way to do this?
Forgive me if this is outside of the scope of this project but...
I don't mind doing a little hacking, I think it could be done by keeping an auxiliary "internal" whisper db that just holds
top values in any given path, eg:
(I'm shooting from the hip here so be gentle if this is comically flawed)
for paths like:
/foo/bar/1
/foo/bar/2
...
/foo/bar/whatever
keep a flat index that ranks the values from 1st to Nth place (over time, of course) and then a client can ask "show me the top N paths in the last ___ [time interval]", where the first flat index gets consulted first for top values in a path for a time frame, then the main db is queried for fine grained data per path.
Question information
- Language:
- English Edit question
- Status:
- Answered
- For:
- Graphite Edit question
- Assignee:
- No assignee Edit question
- Last query:
- Last reply:
Can you help with this problem?
Provide an answer of your own, or ask tyler for more information if necessary.