Improves the current filtering implementation complixity. Currently, the best case is O(N) and worst case O(N^2) for key-value filtering. In the new implementation, the best case is O(1) and worst case O(N), again for key-value filtering. Signed-off-by: David Calavera <david.calavera@gmail.com> Upstream-commit: 93d1dd8036d57f5cf1e5cbbbad875ae9a6fa6180 Component: engine