Record Details


Field	Value

Title	On concurrency control in sliding window queries over data streams

Creator	GOLAB, L BIJAY, KG OZSU, MT

Description	Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of new data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. In this paper, we argue that concurrent processing of queries (reads) and window-slides (writes) is required by data stream systems in order to allow prioritized query scheduling and improve the freshness of answers. We prove that the traditional notion of conflict serializability is insufficient in this context and define stronger isolation levels that restrict the allowed serialization orders. We also design and experimentally evaluate a transaction scheduler that efficiently enforces the new isolation levels.

Publisher	SPRINGER-VERLAG BERLIN

Date	2011-10-23T19:31:39Z 2011-12-15T09:10:44Z 2011-10-23T19:31:39Z 2011-12-15T09:10:44Z 2006

Type	Article; Proceedings Paper

Identifier	ADVANCES IN DATABASE TECHNOLOGY - EDBT 2006,3896,608-626 3-540-32960-9 0302-9743 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15216 http://hdl.handle.net/100/1627

Source	10th International Conference on Extending Database Technology (EDBT),Munich, GERMANY,MAR 26-31, 2006

Language	English

ICAR Research Data Repository for Knowledge Management