Optimizing Processing of Query Subscription in an WDM Network Environment
Abstract
In this paper, we examine query subscription processing in a Wavelength-Division Multiplexing (WDM) network environment. The users (clients) launch their queries through the Internet to an information center, which consists of several servers. The information center then assigns proper servers to process the queries, and sends the query results back to the users.We first model the problem in terms of several optimization criteria such as query processing time required by the servers, the number of wavelengths used for the query result transmissions, and the other parameters contributing to the overall execution/transmission cost. We then present efficient heuristic algorithms to solve the problem.
References
[1]
A. Crespo, O. Buyukkokten, and H. Garcia-Molina. Efficient query subscription processing in a multicast environment. Technical Report, DCS, Stanford Univ., 1998.
[2]
M. Franklin and S. Zdonik. Dissemination-based information systems. Bulletin of the Technical Committee on Data Engineering, 19:20-30, 1996.
[3]
H. N. Gobow and R. E. Tarjan. Faster scaling algorithms for general graph matching problems. J. ACM., 38:815-853, 1990.
[4]
P. E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
[5]
J. E. Hopcroft and R. M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2:225-231, 1973.
[6]
W. Liang and M. E. Orlowska. Optimizing processing of query subscription in an WDM network environment. Technical Report, DCS, Australian National Univ., 1999.
[7]
P.J.M. van Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. Mathematics and its Applications. Reidel Publishing Company, 1987.
[8]
M. V. Mannino, P. Chu, and T. Sager. Statistical profile estimation in database systems. ACM Computing Surveys, 20:191-221, 1988.
[9]
A. D. McAulay. Optical Computer Architectures. John Wiley, 1991.
[10]
C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimizations: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
[11]
P. Raghavan and C. D. Thompson. Randomized rounding: provably good algorithms and algorithmic proofs. Combinatorica 7:365-374, 1987.
[12]
R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine, 31:78-88, 1993.
[13]
R. J. Vitter and D. H. C. Du. Distributed computing with high-speed optical networks. IEEE Computer 26:8-18, 1993.
- Optimizing Processing of Query Subscription in an WDM Network Environment
Recommendations
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Distributed stream join query processing with semijoins
This paper addresses the distributed stream processing of window-based multi-way join queries considering the semijoin as a key join operator. In distributed stream processing, data streams arriving at remote sites need to be shipped to the processing ...
Comments
Information & Contributors
Information
Published In
March 2000
ISBN:0769505406
Copyright © Copyright (c) 2000 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 27 March 2000
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024