On indexed data broadcast

Journal of Computer and System Sciences

Volumn 60, Issue 3, 2000, Pages 575-591

  Khanna, Sanjeev ^a   Zhou, Shiyu ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; DATA ACQUISITION; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; PROBABILITY DISTRIBUTIONS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

ASYMMETRIC COMMUNICATION ENVIRONMENT; INDEXED DATA BROADCAST; MEAN ACCESS TIME; MEAN TUNING TIME;

DATA COMMUNICATION SYSTEMS;

EID: 0034207360     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1688     Document Type: Article

References (21)

1. Acharya S., Alonso R., Franklin M., Zdonik S. Broadcast disks: Data management for asymmetric communication environments. Proc. ACM SIGMOD Conf. May 1995.
2. Ammar M., Wong J. On the optimality of cyclic transmission in teletext systems. IEEE Trans. Comm. 35:1987;1159-1170.
3. Anily S., Glass C., Hassin R. The scheduling of maintenance service. Discrete Appl. Math. 82:1998;27-42.
4. Bar-Noy A., Bhatia R., Naor J., Schieber B. Minimizing service and operation costs of periodic scheduling. Proc. 9th ACM Symp. on Disc. Algorithms. 1998.
5. Bestavros A., Cunha C. Server-initiated document dissemination for the WWW. IEEE Data Engrg. Bull. September 1996.
6. Bowen T. The DATACYCLE architecture. Comm. ACM. 35:1992;71-81.
7. Chan M., Chin F. Schedulers for larger classes of pinwheel instances. Algorithmica. 9:1996;425-462.
8. Gifford D. Tech. Report. 1992.
9. Glass C. Feasibility of scheduling lot sizes of two frequencies on one machine. European J. Oper. Res. 75:1994;354-364.
10. Guibas L., Sedgewick R. A dichromatic framework for balanced trees. IEEE FOCS. 1978;. p. 8-21.
11. Herman C. The datacycle architecture for very large high throughput database systems. Proc. ACM SIGMOD. 1987;. p. 97-103.
12. Holte R., Rosier L., Tulchinsky I., Varvel D. Pinwheel scheduling with two distinct numbers. Theoret. Comput. Sci. 100:1992;105-135.
13. Imielinski T., Vishwanathan S., Badrinath B. Energy efficient indexing on air. Proc. ACM SIGMOD. May 1994.
14. Jain R., Werth J. DIMACS Tech. Report. May 1995.
15. Knuth D. The Art of Computer Programming. 1973;Addison-Wesley, Reading.
16. Pugh W. Skip lists: A probabilistic alternative to balanced trees. Comm. ACM. 33:1990;668-676.
17. Shivakumar N., Venkatasubramanian S. Energy-efficient indexing for information dissemination in wireless systems. ACM-Baltzer J. Mobile Networks and Nomadic Appl. (MONET). December 1996.
18. Sleator D., Tarjan R. A data structure for dynamic trees. J. Comput. System Sci. 26:1983;362-391.
19. Su S., Tassiulas L. Broadcast scheduling for information distribution. INFOCOM. 1997.
20. Wei W., Liu C. On a periodic maintenance problem. Oper. Res. Lett. 2:1983;90-93.
21. Vaidya N., Hameed S. Technical Report. 1996.