2011 IEEE 27th International Conference on Data Engineering 2011
DOI: 10.1109/icde.2011.5767851
|View full text |Cite
|
Sign up to set email alerts
|

SQPR: Stream query planning with reuse

Abstract: When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth, from a set of hosts to queries. Allocation decisions must provide the correct mix of resources required by queries, while achieving an efficient overall allocation to scale in the number of admitted queries. By exploiting overlap between queries and reusing partial results, a query planner can conserve resources but has to carry out m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
46
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 44 publications
(46 citation statements)
references
References 22 publications
(26 reference statements)
0
46
0
Order By: Relevance
“…For this reason, various heuristic methods of operator placement have been proposed to reduce network usage and balance the load among nodes [28]. A method that formulates the operator placement problem as mixed-integer linear programming (MILP) has also been proposed [29]. However, these previous methods assume overlay (mainly peer-to-peer) networks.…”
Section: Operator Placement Of Distributed Stream Processingmentioning
confidence: 99%
See 2 more Smart Citations
“…For this reason, various heuristic methods of operator placement have been proposed to reduce network usage and balance the load among nodes [28]. A method that formulates the operator placement problem as mixed-integer linear programming (MILP) has also been proposed [29]. However, these previous methods assume overlay (mainly peer-to-peer) networks.…”
Section: Operator Placement Of Distributed Stream Processingmentioning
confidence: 99%
“…Operator placement This step allocates the expanded HLQ to the nodes and in-vehicle networks of the target. Unlike previous distributed stream processing [28], [29], AEDSMS converts a physical structure into an architectural graph, which is an approach that is widely used to explore the design space of embedded systems [36]. Next, AEDSMS allocates the queries to the architectural graph, as described in Section 5.5.…”
Section: Design Flow Of Aedsmsmentioning
confidence: 99%
See 1 more Smart Citation
“…A plethora of work exists on static query plan generation for DSM systems. Query planners such as SODA [16] and SQPR [13] formulate query planning and placement as an optimization problem and solve it using standard techniques like mixed integer linear programming (MILP) [12]. We can exploit these approaches to generate an initial query deployment plan from a given logical dataflow graph.…”
Section: B Simulation Experimentsmentioning
confidence: 99%
“…In the AdaptiveCQ framework [17], for efficient processing of multiple continuous queries, the intermediate results of queries are shared at a fine level without materializing them on disk. [8] proposes a query planner for distributed stream processing systems which exploits overlaps between queries and sharing partial results with the objective of efficient resource allocation. In our approach, data sharing is implied without using techniques such as query rewriting.…”
Section: Related Workmentioning
confidence: 99%