A method for the execution of database queries that request information based on one or more underlying data tables stored in a database, and that include predicates defined as conditions under which a given portion of a data table satisfies a portion of the query, the method comprising: receiving a plurality of cardinality estimates for a plurality of predicates p i in the database query, a cardinality estimate indicating an expected size of intermediate results of a given predicate and the plurality of predicates forming a set P; defining, based on the cardinality estimates, first bounds x min, x max for selectivity x of a predicate γ obtained from a combination of two or more predicates by performing one or more of histogram techniques and/or cardinality estimation techniques and/or sampling techniques, wherein the two or more predicates form a subset P' of P and wherein γ ( P') = Λ pi ∈ P, p i ∧ Λ p i ∉ P' ¬ p i; defining second bounds b min, b max for selectivity b of a predicate β obtained from the combination of the two or more predicates by performing one or more of histogram techniques and/or cardinality estimation techniques and/or sampling techniques, wherein β ( P') = Λ pi ∈ P' p i; determining, based on the first bounds and the second bounds for the combination of query predicates, whether for the combination of the query predicates the first and second bounds are consistent wherein the first and second bounds are consistent if the set S:= {[ x, b] | Cx = b, x min ≤ x ≤ x max, b min ≤ b ≤ b max} is non-empty, with C i j = 1 if j ⊇ i 0 else, wherein j ⊇ i denotes the condition that every bit set to '1' in i is also set to '1' in j; determining, when it is determined that the first and second bounds are consistent, at least one selectivity estimate for the combination of the query predicates, wherein a selectivity estimate is a number along with an upper bound and/or a lower bound, wherein the at least one selectivity estimate is calculated, in response to the first bounds and/or the second bounds being within a predetermined distance apart, based on a geometric mean of the first bounds and/or the second bounds; generating, based on the at least one selectivity estimate, a query plan for execution of a database query comprising the query predicates by selecting an order of operations for at least a portion or each of the plurality of predicates, based on the plurality of selectivity estimates, wherein predicates and/or combinations of predicates which are estimated to provide smaller intermediate results are prioritized over predicates and/or combinations of predicates which are estimated to have larger intermediate results; and executing the database query through execution of the query plan. receiving a plurality of cardinality estimates for a plurality of predicates p i in the database query, a cardinality estimate indicating an expected size of intermediate results of a given predicate and the plurality of predicates forming a set P; defining, based on the cardinality estimates, first bounds x min, x max for selectivity x of a predicate γ obtained from a combination of two or more predicates by performing one or more of histogram techniques and/or cardinality estimation techniques and/or sampling techniques, wherein the two or more predicates form a subset P' of P and wherein γ ( P') = Λ pi ∈ P, p i ∧ Λ p i ∉ P' ¬ p i; defining second bounds b min, b max for selectivity b of a predicate β obtained from the combination of the two or more predicates by performing one or more of histogram techniques and/or cardinality estimation techniques and/or sampling techniques, wherein β ( P') = Λ pi ∈ P' p i; determining, based on the first bounds and the second bounds for the combination of query predicates, whether for the combination of the query predicates the first and second bounds are consistent wherein the first and second bounds are consistent if the set S:= {[ x, b] | Cx = b, x min ≤ x ≤ x max, b min ≤ b ≤ b max} is non-empty, with C i j = 1 if j ⊇ i 0 else, wherein j ⊇ i denotes the condition that every bit set to '1' in i is also set to '1' in j; determining, when it is determined that the first and second bounds are consistent, at least one selectivity estimate for the combination of the query predicates, wherein a selectivity estimate is a number along with an upper bound and/or a lower bound, wherein the at least one selectivity estimate is calculated, in response to the first bounds and/or the second bounds being within a predetermined distance apart, based on a geometric mean of the first bounds and/or the second bounds; generating, based on the at least one selectivity estimate, a query plan for execution of a database query comprising the query predicates by selecting an order of operations for at least a portion or each of the plurality of predicates, based on the plurality of selectivity estimates, wherein predicates and/or combinations of predicates which are estimated to provide smaller intermediate results are prioritized over predicates and/or combinations of predicates which are estimated to have larger intermediate results; and executing the database query through execution of the query plan.