We design asymptotically optimal query strategies for the class of parity functions which contain at most k essential variables. The number of questions asked is at most twice the number asked by an optimal strategy. The strategy presented is even non-adaptive. For fixed k, the number of questions is optimal up to additive constants. Our results improve upon results by Uehara, Tsuchida and Wegener [6].