S. Acharya, M. Franklin, and S. Zdonik. Balancing push & pull for data broadcast. In SIGMOD, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Online Dynamic Reordering - Raman, Raman, Hellerstein (2000) (2 citations) (Correct)
....recently panned over by the user. If we were to do this in a client server setting where the user is seeing a spreadsheet on a client node and the data is on a separate server, then we believe that we could use multi level caching schemes to avoid repeatedly sending the same data to the client [Acharya et al. 1997]. To place the timings in our experiment in perspective, consider the time required to sort a 250MB file. The disk we use gives a sequential read bandwidth of 9.77MB s. Even assuming that sorting a file is equivalent to simply two sequential I Os of it (one to read it in and create runs ....
Acharya, S., Franklin, M., and Zdonik, S. Balancing push & pull for data broadcast. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, 1997.
Online Dynamic Reordering for Interactive Data Processing - Vijayshankar Raman Bhaskaran (1999) (16 citations) (Correct)
No context found.
S. Acharya, M. Franklin, and S. Zdonik. Balancing push & pull for data broadcast. In SIGMOD, 1997.
Online Dynamic Reordering for Interactive Data Processing - Vijayshankar Raman (1999) (16 citations) (Correct)
No context found.
S. Acharya et al. Balancing push & pull for data broadcast. In SIGMOD, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC