A generic flow algorithm for shared filter ordering problems

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

Volumn , Issue , 2008, Pages 79-88

  Liu, Zhen ^a   Parthasarathy, Srinivasan ^a   Ranganathan, Anand ^a   Yang, Hao ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Flow maximization; Parallel copyright 2008 acm; Query optimization; Shared filter ordering

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COSTS; DATABASE SYSTEMS; OPTIMIZATION; SIGNAL INTERFERENCE;

APPROXIMATION RATIOS; BOOLEAN FILTERS; DATA STREAMS; EVALUATION PLANS; FLOW ALGORITHMS; FLOW MAXIMIZATION; MAXIMIZATION ALGORITHMS; MAXIMIZATION PROBLEMS; MULTIPLE QUERIES; ORDERING ALGORITHMS; PARALLEL COPYRIGHT 2008 ACM; PARALLEL ENVIRONMENTS; PARALLEL PROCESSORS; QUERY OPTIMIZATION; SHARED FILTER ORDERING; SINGLE PROCESSORS; TOTAL COSTS;

PARALLEL ALGORITHMS;

EID: 57549117311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376929     Document Type: Conference Paper

References (25)

1. Ron Avnur and Joseph M. Hellerstein. Eddies: continuously adaptive query processing. SIGMOD Rec., 29(2):261-272, 2000.
2. Shivnath Babu, Rajeev Motwani, Kamesh Munagala, Itaru Nishizawa, and Jennifer Widom. Adaptive ordering of pipelined stream filters. In SIGMOD, pages 407-418, New York, NY, USA, 2004. ACM Press.
3. Amotz Bar-Noy, Mihir Bellare, Magnt'us M. Halldt'orsson, Hadas Shachnai, and Tami Tamir. On chromatic sums and distributed resource allocation. Inf. Comput, 140(2): 183-202, 1998.
4. Surajit Chaudhuri, Umeshwar Dayal, and Tak W. Yan. Join queries with external text sources: execution and optimization techniques. In SIGMOD '95: Proceedings of the 1995 ACM SIGMOD international conference on Management of data, pages 410-422, New York, NY, USA, 1995. ACM.
5. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
6. Edith Cohen, Amos Fiat, and Haim Kaplan. Efficient sequences of trials. In SODA, pages 737-746, 2003.
7. Anne Condon, Amol Deshpande, Lisa Hellerstein, and Ning Wu. Flow algorithms for two pipelined filter ordering problems. In PODS, pages 193-202, New York, NY, USA, 2006. ACM Press.
8. Amol Deshpande, Carlos Guestrin, Wei Hong, and Samuel Madden. Exploiting correlated attributes in acquisitional query processing. In ICDE '05: Proceedings of the 21st International Conference on Data Engineering, pages 143-154, Washington, DC, USA, 2005. IEEE Computer Society.
9. Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, and Orli Waarts. Efficient information gathering on the internet (extended abstract). In FOCS, pages 234-243, 1996.
10. Uriel Feige and Prasad Tetali. Approximating min sum set cover. Algorithmica, 40(4):219-234, 2004.
11. N. Garg and J. Koenemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 300. IEEE Computer Science Society, 1998.
12. Roy Goldman and Jennifer Widom. Wsq/dsq: a practical approach for combined querying of databases and the web. In SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 285-296, New York, NY, USA, 2000. ACM.
13. J. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proc. SIGMOD, 1993.
14. W. Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13-30, 1963.
15. T. Ibaraki and T. Kameda. On the optimal nesting order for computing n-relational joins. ACM Trans, on Database Systems, 9(3):482-502, 1984.
16. Haim Kaplan, Eyal Kushilevitz, and Yishay Mansour. Learning with attribute costs. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 356-365, New York, NY, USA, 2005. ACM.
17. Murali S. Kodialam. The throughput of sequential testing. In Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization, pages 280-292, London, UK, 2001. Springer-Verlag.
18. Ravi Krishnamurthy, Haran Boral, and Carlo Zaniolo. Optimization of nonrecursive queries. In Proc. VLDB, pages 128-137, 1986.
19. Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, and Hao Yang. Near-optimal algorithms for shared filter evaluation in data stream systems. In Proc. of ACM SIGMOD (to appear), 2008.
20. Kamesh Munagala, Shivnath Babu, Rajeev Motwani, and Jennifer Widom. The pipelined set cover problem. In 10th International Conference on Database Theory - ICDT, pages 83-98, 2005.
21. Kamesli Munagala, Utkarsh Srivastava, and Jennifer Widom, Optimization of continuous queries with shared expensive filters. In PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 215-224, New York, NY, USA, 2007. ACM.
22. Serge A. Plotkin, David B. Shmoys, and Éva Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proceedings of the 32nd annual symposium on Foundations of computer science, pages 495-504, Los Alamitos, CA, USA, 1991. IEEE Computer Society Press.
23. H. Simon and J. Kadane. Optimal problem-solving search: All-or-none solutions. Artificial Intelligence, 6:235Ü-247, 1975.
24. Vijay V. Vazirani. Approximation algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001.
25. Neal E. Young. Sequential and parallel algorithms for mixed packing and covering. In Proceedings of IEEE Symposium on Foundations of Computer Science, 2001.