Efficient In-Network Evaluation of Multiple Queries

  • Vinayaka Pandit
  • Hui-bo Ji
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4297)


Recently, applications in which relational data is generated in a distributed and streaming manner have emerged from diverse domains. Processing queries on such data has become very important. In-network evaluation of a query is a technique in which the query is evaluated in the network without transferring all the data to a central location. So far, algorithms for in-network of evaluation of a single query have been proposed. They are not designed to exploit common computations across multiple queries. There is a need to develop techniques for efficient in-network evaluation of multiple queries. We consider the problem of in-network evaluation of multiple queries on relational data generated on a distributed network of machines. We present a novel algorithm based on an algorithm for dynamic regrouping of queries.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahmad, Y., Cetintemel, U.: Network aware query processing for stream based applications. In: Proceedings of Very Large Data Bases (VLDB) (2004)Google Scholar
  2. 2.
    Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R., Sturman, D.: An efficient multicast protocol for content based publish-subscribe systems. In: Proceedings of the international conference on distributed computing systems (1999)Google Scholar
  3. 3.
    Chen, J., Dewitt, D.: Dynamic regrouping of continuous queries. Technical report, University of Wisconsin-Madison (2002)Google Scholar
  4. 4.
    Chen, J., DeWitt, D., Naughton, J.: Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In: ICDE, pp. 345–356 (2002)Google Scholar
  5. 5.
    Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gkantsidis, C., Mihail, M., Zegura, E.: The markov chain simulation method for generating connected power law random graphs. In: ALENEX (2003)Google Scholar
  7. 7.
    Jin, Y., Strom, R.: Relational subscription middleware for internet-scale publish-subscribe. In: DEBS (2003)Google Scholar
  8. 8.
    Melançon, G., Philippe, F.: Generating connected acyclic digraphs uniformly at random. Information Processing Letters 90(4), 209–213 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Munagala, K., Babu, S., Motwani, R., Widom, J.: The pipelined set cover problem. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 83–98. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Pandit, V., Strom, R., Buttner, G., Ginis, R.: Performance modeling and placement of transforms for distributed stream processing. IBM Research Report (2006)Google Scholar
  11. 11.
    Plale, B., Schwan, K.: Dynamic querying of streaming data with the dquob system. IEEE Transactions on Parallel and Distributed Databases 14(4) (2003)Google Scholar
  12. 12.
    Rosenthal, A., Chakravarthy, U.: Anatomy of a modular multiple query optimizer. In: VLDB, pp. 230–239 (1988)Google Scholar
  13. 13.
    Roy, P.: Multiquery optimization and Applications. PhD thesis, IIT Bombay (2000)Google Scholar
  14. 14.
    Strom, R.: Extending a content based publish-subscribe system with relational subscriptions. Technical report, IBM Research (2003)Google Scholar
  15. 15.
    Sellis, T.: Multiple query optimization. ACM Transactions on database systems 10(3) (1986)Google Scholar
  16. 16.
    Srivastava, U., Munagala, K., Widom, J.: Operator placement for in-network stream query processing. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS) (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vinayaka Pandit
    • 1
  • Hui-bo Ji
    • 2
  1. 1.IBM India Research Laboratory 
  2. 2.Australian National University 

Personalised recommendations