Conference Paper

On the Complexity of Multi-Query Optimization in Stream Grids

Conference: Proceedings of the 15th International Conference on Management of Data, December 9-12, 2009, International School of Information Management, Mysore, India
Source: DBLP


Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of sensor networks for a wide range of applications, from monitoring geophysical activities to supply chain management coupled with applications like network monitoring. Queries external to the system arrive on any node in the grid seeking data from one or more data streams. The kind of queries considered in this work are (1) lifetime queries and (2) long running queries where new query arrivals and query revocations are infrequent. From the system perspective, computing the optimal query plan for the set of queries incident on the grid would ensure minimal system-wide resource usage, thereby maximizing the number of concurrent queries that can be supported. The key challenge in such a system is multi-query optimization. In this work, we analyze the complexity of multi-query optimization for select, project and join queries in isolation and propose algorithms for computing optimal query plans if polynomial time algorithms exist. 1

Download full-text


Available from: Srinath Srinivasa, Oct 05, 2015
12 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: SHORE (Scalable Heterogeneous Object REpository) is a persistent object system under development at the University of Wisconsin. SHORE represents a merger of objectoriented database and file system technologies. In this paper we give the goals and motivation for SHORE, and describe how SHORE provides features of both technologies. We also describe some novel aspects of the SHORE architecture, including a symmetric peer-to-peer server architecture, server customization through an extensible value-added server facility, and support for scalabilityonmultiprocessor systems. An initial version of SHORE is already operational, and we expect a release of Version 1 in mid-1994.
    ACM SIGMOD Record 01/2001; DOI:10.1145/191839.191915 · 1.05 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869-0481, or 2 D. Kossmann and K. Stocker 1. INTRODUCTION The great commercial success of database systems is partly due to the development of sophisticated query optimization technology: users pose queries in a declarative way using SQL or OQL, and the optimizer of the database system finds a good way (i.e., plan) to execute these queries. The optimizer, for example, determines which indices should be used to execute a query and in which order the operations of a query (e.g., joins and group-bys) should be executed. To this end, the optimizer enumerates alternative plans, estimates the cost of every plan using a cost model, and chooses the p...
    ACM Transactions on Database Systems 12/1999; 25(1). DOI:10.1145/352958.352982 · 0.68 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research Laboratory.
Show more