Abstract: Techniques for real-time scheduling for distributed query processing are provided. In one technique, a global counter and multiple local counters are stored, each local counter corresponding to a different query of multiple queries. Each query is scheduled based on the multiple local counters and the global counter. In response to determining that a particular query is waiting for data to arrive at a computing node, a first current value of the global counter is stored in association with the particular query. In response to determining that the data has arrived at the computing node: a current value of the global counter is identified; a difference between the second current value and the first current value is determined; and a current value of the local counter of the particular query is updated based on the difference.