Operator placement for in-network stream query processing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 250-258

  Srivastaya, Utkarsh ^a   Munagala, Kamesh ^b   Widom, Jennifer ^a  

^a STANFORD UNIVERSITY   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK BANDWIDTH; SENSOR NETWORKS; STREAM QUERY PROCESSING;

ALGORITHMS; COMPUTATION THEORY; DATA COMMUNICATION SYSTEMS; SENSORS;

QUERY LANGUAGES;

EID: 33244476757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Y. Ahmad and U. Cetintemel. Network-aware query processing for stream-based applications. In Proc. of the 2004 Intl. Conf. on Very Large Data Bases, pages 456-467, Sept. 2004.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. of the 2002 ACM Symp. on Principles of Database Systems, pages 1-16, June 2002.
3. S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. ACM Trans. on Database Systems, 24(2): 177-228, 1999.
4. J. Chen, D. J. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for internet databases. In Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, pages 379-390, May 2000.
5. M. Cherniack et al. Scalable distributed stream processing. In Proc. First Biennial Conf. on Innovative Data Systems Research (CIDR), Jan. 2003.
6. C. Cranor et al. Gigascope: high performance network monitoring with an SQL interface. In Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data, page 623, May 2002.
7. A. Deshpande, S. Nath, P. Gibbons, and S. Seshan. Cache-and-query for wide area sensor databases. In Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data, pages 503-514, 2003.
8. R. Epstein, M. Stonebraker, and E. Wong. Distributed query processing in a relational data base system. In Proc. of the 1978 ACM SIGMOD Intl. Conf. on Management of Data, pages 169-180, May 1978.
9. U. Feige, L. Lovász, and P. Tetali. Approximating min-sum set cover. Algorithmica, 2004.
10. M. Franklin et al. Design Considerations for High Fan-in Systems: The HiFi Approach. In Proc. Second Biennial Conf. on Innovative Data Systems Research (CIDR), Jan. 2005.
11. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
12. L. Haas et al. R*: A Research Project on Distributed Relational DBMS. IEEE Data Engineering Bulletin, 5(4):28-32, 1982.
13. J. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proc. of the 1993 ACM SIGMOD Intl. Conf. on Management of Data, pages 267-276, 1993.
14. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: A tiny aggregation service for ad-hoc sensor networks. In Proceedings of the 5th USENIX Symposium on OSDI, Dec. 2002.
15. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. The design of an acquisitional query processor for sensor networks. In Proc. of the 2003 ACM SIGMOD Intl. Conf. on Management of Data, pages 491-502, 2003.
16. K. Munagala, S. Babu, R. Motwani, and J. Widom. The pipelined set cover problem. Proc. Intl. Conf. Database Theory, 2005. (To appear).
17. P. Pietzuch et al. Path optimization in stream-based overlay networks. Technical report, Harvard University, 2004.
18. S. Viglas, J. F. Naughton, and J. Burger. Maximizing the output rate of multi-join queries over streaming information sources. In Proc. of the 2003 Intl. Conf. on Very Large Data Bases, pages 285-296, Sept. 2003.