Giter VIP home page Giter VIP logo

Comments (6)

brian-brazil avatar brian-brazil commented on June 9, 2024

With atomicity and staleness handling, which I hope to get in with the new storage for 2.0, I can see this requiring more involved logic which makes considerations around the current implementation largely moot.

Let's get something working, and then benchmark.

from tsdb.

fabxc avatar fabxc commented on June 9, 2024

Federation does work modulo #10 which can cause duplicate entries for overlapping selectors right now. So yes, this is is a low priority issue for now.

from tsdb.

beorn7 avatar beorn7 commented on June 9, 2024

Just two thoughts at this point (not much time to dig deeper):

  • The fast access path for the last sample was not only motivated by federation but also by the fact that rule evaluation are often just accessing the last sample of a series.

  • Given that allocation churn of the query layer seems a problem right now, I could imagine that a low-alloc access path to the last sample would help here (note that many advanced setups have a huge amount of rule evaluations going on all the time). (This is based on naïve code reading if how the iteration for for federation works. Might be all wrong.)

from tsdb.

fabxc avatar fabxc commented on June 9, 2024

The fast access path for the last sample was not only motivated by federation but also by the fact that rule evaluation are often just accessing the last sample of a series.

To my knowledge rule evaluations are just regular queries and do not make us of the particular storage call. The query engine does not use it internally either.
I'd argue that almost all rule evaluations that are relevant in cost, use time aggregation anyway and it doesn't apply.

Given that allocation churn of the query layer seems a problem right now, I could imagine that a low-alloc access path to the last sample would help here (note that many advanced setups have a huge amount of rule evaluations going on all the time). (This is based on naïve code reading if how the iteration for for federation works. Might be all wrong.)

Not so much of a problem. Just way higher than it would need to be. The allocs don't relate so much to access but to what the QE allocates itself. v2 also allocates internally when being queried, but that's not happening in v3.

from tsdb.

beorn7 avatar beorn7 commented on June 9, 2024

Storage v2 transparently returns an "instant" series iterator for an instant query with a timestamp beyond the end of a series.

But yes, range queries obviously cannot benefit from that.

from tsdb.

fabxc avatar fabxc commented on June 9, 2024

As per reports federation actually works faster already and there's currently no need for adding complexity of the fast access.

from tsdb.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.