Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Chain: operator scheduling for memory minimization in data stream systems
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A service-curve approach to performance guarantees in integrated-service networks
A service-curve approach to performance guarantees in integrated-service networks
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Monitoring streams: a new class of data management applications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Operator scheduling in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
QStream: deterministic querying of data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In a growing number of web-based applications, massive data takes the form of continuous data streams. Most of these applications have deterministic and sophisticated performance requirements that need to be met under unbounded, high-volume and time-varying data streams. To be different from best-effort service providing, deterministic quality of service is generalized and modelled based on the theory of network calculus in this paper. A simple and efficient admission control mechanism is provided to determine the schedulability of several continuous queries with their QoS requirements satisfied simultaneously. Once the queries are admitted into the DSMS, our proposed QoS-Guaranteed scheduling algorithm assigns priorities to ready tuples that ensure all the QoS requirements. Furthermore, a QoS-Guaranteed batch-processing scheme is extended to reduce the query-scheduling overhead. Experiments are presented to illustrate and validate our strategies.