Paper Info
Title
Automated operator placement in distributed Data Stream Management Systems subject to user constraints
Abstract
Traditional distributed Data Stream Management Systems assign query operators to sites by optimizing for some criterion such as query throughput, or network delay. The work presented in this paper begins to augment this traditional operator placement technique by allowing the user issuing a continuous query to specify a variety of constraints - including collocation, upstream/downstream, and tag- or attribute-based constraints - controlling operator placement within the query network. Given a set of constraints, operators, and sites; four strategies are presented for optimizing the operator placement. An optimal brute force algorithm is presented first for smaller cases, followed by linear programming, constraint satisfaction, and local search strategies. The four methods are compared for speed, accuracy, and efficiency, with constraint satisfaction performing the best, and allowing assignments to be adapted on the fly by the DDSMS.
Year
DOI
Venue
2014
10.1109/ICDEW.2014.6818346
Data Engineering Workshops
Keywords
Field
DocType
data handling,database management systems,distributed processing,linear programming,query processing,search problems,automated operator placement,constraint satisfaction,continuous query,distributed data stream management systems,linear programming,local search strategies,optimal brute force algorithm,query network,query operators,stream distributed database management systems,user constraints
Query throughput,Query optimization,Constraint satisfaction,Data mining,Network delay,Brute-force search,Query expansion,Computer science,Sargable,Operator (computer programming),Database,Distributed computing
Conference
Citations 
PageRank 
References 
5
0.45
5
Authors
3
Name
Order
Citations
PageRank
Cory Thoma1131.91
Alexandros Labrinidis21374191.50
Adam J. Lee3214.70