Query variable scalability and performance

[beepsoft]

Thanks for your answer!

@Rahul

A Filter operation has cost of O(number of results) in that sub-query because we iterate over all results and filter out the ones that match the condition. So every new filter you add can will add a small cost to the query.

Just one followup question if I may: is this true for all @filter operations, they are all done sequentially?

So, in case of my original query:

query dentry($dict: string){
	var(func: eq(shortName, $dict)) {
  	  ~dict @filter(eq(dgraph.type, "Meaning")) {
    	    MEANING_UID as uid
  	}
  }

	var(func: eq(shortName, $dict)) {
  	  ~dict @filter(eq(dgraph.type, "Word")) {
    	    WORD_UID as uid
  	}
  }  
  
  dentry(func: allofterms(content, "apple")) @filter(uid(WORD_UID)){
    content
    meaning @filter(uid(MEANING_UID)) {
      translation @filter(uid(WORD_UID)) {
        content
      }
    }
  }
}

the @filter(uid(MEANING_UID) and @filter(uid(WORD_UID)) are both done sequentially and not using any indexing?