The classic standard assumptions (such as DDH, CDH) are not parametrized and always have constant size (are static). Consequently, the assumption when used in a reductionist proof is independent of any system parameters or oracle queries and only related to the security parameter.
In contrast, non-static ($q$-type) assumptions as already mentioned by Travis are parametrized (and actually a family of assumptions). They may be used in a static way (e.g., as 2-DBDHI), but if a reductionists proof relies on the non-static version, e.g., $q$-DBDHI, then $q$ is usually related to the number of oracle queries an adversary makes. For instance, if you have a signature scheme where a $q$-type assumption is used, then $q$ usually corresponds to the number of signing oracle queries an adversary makes and then the reduction works (you may for instance look at "Short Signatures Without Random Oracles" from Dan Boneh and Xavier Boyen, who reduce the security of their scheme to the $q$-SDH assumption). Consequently, the more signing queries an adversary is allowed to do, the larger the problem instance and usually the stronger the required assumption gets (observe that for static assumptions this does not influence the assumption itself). As Travis has mentioned some $q$-type assumptions can be converted to static assumptions such as subgroup hiding (typically in composite order bilinear groups).
Another class of assumptions which are typically seen to be stronger than $q$-type assumptions are interactive assumptions. Here, the assumption itself involves some oracle. A classic example are one-more assumptions (one-more RSA inversion, one-more CDH, LRSW assumption), where having $n$ times access to a "helper" oracle that solves some hard tasks on one of the $n$ inputs each, the assumption states that it does not help to solve the task on $m>n$ inputs. Another classic example for this type of assumption are knowledge of exponent assumptions, where solving some hard tasks implies some oracle (extractor) that extracts some value that the solver is implicitly assumed to know in order to solve the hard task. Interactive assumptions are non-falsifiable (you may read this paper) and thus people usually try to avoid them.