High-throughput query scheduling with spatial clustering based on distributed exponential moving average
Cited 0 times inCited 0 times in
- High-throughput query scheduling with spatial clustering based on distributed exponential moving average
- Nam, Beomseok; Hwang, Deukyeon; Kim, Jinwoong; Shin, Minho
- Issue Date
- DISTRIBUTED AND PARALLEL DATABASES, v.30, no.5-6, pp.401 - 414
- In distributed scientific query processing systems, leveraging distributed cached data is becoming more important. In such systems, a front-end query scheduler distributes queries among many application servers rather than processing queries in a few high-performance workstations. Although many query scheduling policies exist such as round-robin and load-monitoring, they are not sophisticated enough to exploit cached results as well as balance the workload. Efforts were made to improve the query processing performance using statistical methods such as exponential moving average. However, existing methods have limitations for certain query patterns: queries with hotspots, or dynamic query distributions. In this paper, we propose novel query scheduling policies that take into account both the contents of distributed caching infrastructure and the load balance among the servers. Our experiments show that the proposed query scheduling policies outperform existing policies by producing better query plans in terms of load balance and cache-hit ratio.
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.