๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Workload scheduling for multiple query processing

โœ Scribed by Kian-Lee Tan; Hongjun Lu


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
607 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Query processing techniques for arrays
โœ Arunprasad P. Marathe; Kenneth Salem ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 315 KB
Efficient Scheduling Strategies for Proc
โœ Bharadwaj Veeravalli; Gerassimos Barlas ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 551 KB

The problem of scheduling multiple divisible loads on bus networks is addressed in this paper. The objective is to minimize the total processing time of all the divisible loads submitted to the system for processing. A heterogeneous system of processors in the network is considered, and strategies t

Parallel query processing for OLAP in gr
โœ Nelson Kotowski; Alexandre A. B. Lima; Esther Pacitti; Patrick Valduriez; Marta ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 174 KB
An adaptive query processing strategy fo
โœ Hajime Shibata; Masahiko Tsukamoto; Shojiro Nishio ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 542 KB

Concerning information access for portable terminals, various methods of managing positional information as well as access methods are considered. Which is the optimum of those methods depends on network conditions, such as the speed of movement of the mobile host and the number of access requests t