Continuous query processing with concurrency control

Reading updatable resources consistently

Masafumi Oyamada, Hideyuki Kawashima, Hiroyuki Kitagawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

A recent trend in data stream processing shows the use of advanced continuous queries (CQs) that reference non-streaming resources such as relational data in databases and machine learning models. Since non-streaming resources could be shared among multiple systems, resources may be updated by the systems during the CQ-execution. As a consequence, CQs may reference resources inconsistently, and lead to a wide range of problems from inappropriate results to fatal system failures. We address this inconsistency problem by introducing the concept of transaction processing onto data stream processing. We introduce CQ-derived transaction, a concept that derives read-only transactions from CQs, and illustrate that the inconsistency problem is solved by ensuring serializabil-ity of derived transactions and resource updating transactions. To ensure serializability, we propose three CQ-processing strategies based on concurrency control techniques: two-phase lock strategy, snapshot strategy, and optimistic strategy. Experimental study shows our CQ-processing strategies guarantee proper results, and their performances are comparable to the performance of conventional strategy that could produce improper results.

Original languageEnglish
Title of host publication28th Annual ACM Symposium on Applied Computing, SAC 2013
Pages788-794
Number of pages7
DOIs
Publication statusPublished - 2013 May 27
Externally publishedYes
Event28th Annual ACM Symposium on Applied Computing, SAC 2013 - Coimbra, Portugal
Duration: 2013 Mar 182013 Mar 22

Other

Other28th Annual ACM Symposium on Applied Computing, SAC 2013
CountryPortugal
CityCoimbra
Period13/3/1813/3/22

Fingerprint

Concurrency control
Query processing
Processing
Learning systems

Keywords

  • Concurrency control
  • Continuous query
  • Data stream processing
  • Transaction

ASJC Scopus subject areas

  • Software

Cite this

Oyamada, M., Kawashima, H., & Kitagawa, H. (2013). Continuous query processing with concurrency control: Reading updatable resources consistently. In 28th Annual ACM Symposium on Applied Computing, SAC 2013 (pp. 788-794) https://doi.org/10.1145/2480362.2480514

Continuous query processing with concurrency control : Reading updatable resources consistently. / Oyamada, Masafumi; Kawashima, Hideyuki; Kitagawa, Hiroyuki.

28th Annual ACM Symposium on Applied Computing, SAC 2013. 2013. p. 788-794.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Oyamada, M, Kawashima, H & Kitagawa, H 2013, Continuous query processing with concurrency control: Reading updatable resources consistently. in 28th Annual ACM Symposium on Applied Computing, SAC 2013. pp. 788-794, 28th Annual ACM Symposium on Applied Computing, SAC 2013, Coimbra, Portugal, 13/3/18. https://doi.org/10.1145/2480362.2480514
Oyamada M, Kawashima H, Kitagawa H. Continuous query processing with concurrency control: Reading updatable resources consistently. In 28th Annual ACM Symposium on Applied Computing, SAC 2013. 2013. p. 788-794 https://doi.org/10.1145/2480362.2480514
Oyamada, Masafumi ; Kawashima, Hideyuki ; Kitagawa, Hiroyuki. / Continuous query processing with concurrency control : Reading updatable resources consistently. 28th Annual ACM Symposium on Applied Computing, SAC 2013. 2013. pp. 788-794
@inproceedings{3d2546829be8447492e856b4807f7a9f,
title = "Continuous query processing with concurrency control: Reading updatable resources consistently",
abstract = "A recent trend in data stream processing shows the use of advanced continuous queries (CQs) that reference non-streaming resources such as relational data in databases and machine learning models. Since non-streaming resources could be shared among multiple systems, resources may be updated by the systems during the CQ-execution. As a consequence, CQs may reference resources inconsistently, and lead to a wide range of problems from inappropriate results to fatal system failures. We address this inconsistency problem by introducing the concept of transaction processing onto data stream processing. We introduce CQ-derived transaction, a concept that derives read-only transactions from CQs, and illustrate that the inconsistency problem is solved by ensuring serializabil-ity of derived transactions and resource updating transactions. To ensure serializability, we propose three CQ-processing strategies based on concurrency control techniques: two-phase lock strategy, snapshot strategy, and optimistic strategy. Experimental study shows our CQ-processing strategies guarantee proper results, and their performances are comparable to the performance of conventional strategy that could produce improper results.",
keywords = "Concurrency control, Continuous query, Data stream processing, Transaction",
author = "Masafumi Oyamada and Hideyuki Kawashima and Hiroyuki Kitagawa",
year = "2013",
month = "5",
day = "27",
doi = "10.1145/2480362.2480514",
language = "English",
isbn = "9781450316569",
pages = "788--794",
booktitle = "28th Annual ACM Symposium on Applied Computing, SAC 2013",

}

TY - GEN

T1 - Continuous query processing with concurrency control

T2 - Reading updatable resources consistently

AU - Oyamada, Masafumi

AU - Kawashima, Hideyuki

AU - Kitagawa, Hiroyuki

PY - 2013/5/27

Y1 - 2013/5/27

N2 - A recent trend in data stream processing shows the use of advanced continuous queries (CQs) that reference non-streaming resources such as relational data in databases and machine learning models. Since non-streaming resources could be shared among multiple systems, resources may be updated by the systems during the CQ-execution. As a consequence, CQs may reference resources inconsistently, and lead to a wide range of problems from inappropriate results to fatal system failures. We address this inconsistency problem by introducing the concept of transaction processing onto data stream processing. We introduce CQ-derived transaction, a concept that derives read-only transactions from CQs, and illustrate that the inconsistency problem is solved by ensuring serializabil-ity of derived transactions and resource updating transactions. To ensure serializability, we propose three CQ-processing strategies based on concurrency control techniques: two-phase lock strategy, snapshot strategy, and optimistic strategy. Experimental study shows our CQ-processing strategies guarantee proper results, and their performances are comparable to the performance of conventional strategy that could produce improper results.

AB - A recent trend in data stream processing shows the use of advanced continuous queries (CQs) that reference non-streaming resources such as relational data in databases and machine learning models. Since non-streaming resources could be shared among multiple systems, resources may be updated by the systems during the CQ-execution. As a consequence, CQs may reference resources inconsistently, and lead to a wide range of problems from inappropriate results to fatal system failures. We address this inconsistency problem by introducing the concept of transaction processing onto data stream processing. We introduce CQ-derived transaction, a concept that derives read-only transactions from CQs, and illustrate that the inconsistency problem is solved by ensuring serializabil-ity of derived transactions and resource updating transactions. To ensure serializability, we propose three CQ-processing strategies based on concurrency control techniques: two-phase lock strategy, snapshot strategy, and optimistic strategy. Experimental study shows our CQ-processing strategies guarantee proper results, and their performances are comparable to the performance of conventional strategy that could produce improper results.

KW - Concurrency control

KW - Continuous query

KW - Data stream processing

KW - Transaction

UR - http://www.scopus.com/inward/record.url?scp=84877947836&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877947836&partnerID=8YFLogxK

U2 - 10.1145/2480362.2480514

DO - 10.1145/2480362.2480514

M3 - Conference contribution

SN - 9781450316569

SP - 788

EP - 794

BT - 28th Annual ACM Symposium on Applied Computing, SAC 2013

ER -