You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@druid.apache.org by GitBox <gi...@apache.org> on 2019/02/03 10:09:03 UTC

[GitHub] Dylan1312 commented on issue #6993: [Proposal] Dynamic prioritization and laning

Dylan1312 commented on issue #6993: [Proposal] Dynamic prioritization and laning
URL: https://github.com/apache/incubator-druid/issues/6993#issuecomment-460038788
 
 
   Sounds great.
   
   Instead of using the interval to decide how to change the priority of the query, what do you think about using the number of segments that the query operates over? Appreciate that this mechanism is to be expanded upon in future work but in the short term I think this works better because it more directly correlates with the amount of work a query has to do.
   
   E.G.
   
   Query A queries a huge datasource with 10 segments per-hour over 6 months, this requires ~40k segments to be queried.
   
   Query B queries a relatively sparse datasources that's been compacted nicely to have a single segment per day over 6 months, this requires ~200 segments to be queried. 

----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on GitHub and use the
URL above to go to the specific comment.
 
For queries about this service, please contact Infrastructure at:
users@infra.apache.org


With regards,
Apache Git Services

---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@druid.apache.org
For additional commands, e-mail: commits-help@druid.apache.org