You are viewing a plain text version of this content. The canonical link for it is here.

Posted to notifications@skywalking.apache.org by GitBox <gi...@apache.org> on 2021/06/14 08:09:34 UTC

[GitHub] [skywalking-banyandb] lujiajing1126 edited a comment on pull request #5: Feat: query module

lujiajing1126 edited a comment on pull request #5:
URL: https://github.com/apache/skywalking-banyandb/pull/5#issuecomment-860476382


   > > the indexed to be used is determinant which does not need further optimization
   > 
   > No. Once composite indices are introduced, we should choose which index or indices should be used, and ignore some particular index.
   
   I see.
   
   > > A DAG is hard to be optimized.
   > 
   > Isn't the DAG composited by request/query? The DAGs should be varied depending on the criteria.
   
   No. I mean as long as a DAG is generated, it is hard to optimize it since we can only know its parents and children during the graph walk.
   
   So I suppose, in our context, we can generate/choose an already optimized "logical" plan according to the criteria instead of optimizing an existing set of logical plans like what a general databse does.
   


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to 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