We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
Stand-alone threading libraries lack sophisticated memory management techniques. In this paper, we present a methodology that allows threading libraries that implement non-preempti...
We present a multistage model for allocation of financial resources to bond indices in different currencies. The model was tested on historical data of interest and exchange rates...
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman