A Continuous Query Processing System for XML Stream Data

Seungchul Han; Hyunchul Kang

doi:10.3745/kipstd.2004.11d.7.1375

A Continuous Query Processing System for XML Stream Data

The KIPS Transactions PartD ◽

10.3745/kipstd.2004.11d.7.1375 ◽

2004 ◽

Vol 11D (7) ◽

pp. 1375-1384

Author(s):

Seungchul Han ◽

Hyunchul Kang

Keyword(s):

Query Processing ◽

Processing System ◽

Continuous Query ◽

Stream Data ◽

Continuous Query Processing ◽

Xml Stream

Download Full-text

A Continuous Query Processing System for RFID Data Stream

INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences ◽

10.4156/aiss.vol5.issue8.150 ◽

2013 ◽

Vol 5 (8) ◽

pp. 1282-1289

Author(s):

Chang Hyun Park ◽

Hyung Rim Choi ◽

Byung Kwon Park ◽

Young Jae Park

Keyword(s):

Query Processing ◽

Data Stream ◽

Processing System ◽

Continuous Query ◽

Rfid Data ◽

Continuous Query Processing

Download Full-text

Location based Continuous Query Processing over Geo-streaming Data

Turkish Journal of Computer and Mathematics Education (TURCOMAT) ◽

10.17762/turcomat.v12i1s.1583 ◽

2021 ◽

Vol 12 (1S) ◽

pp. 106-114

Author(s):

K. V. Metre

Keyword(s):

Query Processing ◽

Database Systems ◽

Streaming Data ◽

Continuous Query ◽

Data Parallelism ◽

Stream Data ◽

Process Stream ◽

Data Intensive ◽

Index Maintenance ◽

Continuous Query Processing

In recent years, many data-intensive and location based applications have emerged that need to process stream data in applications such as network monitoring, telecommunications data management, and sensor networks. Unlike regular queries, a continuous query exists for certain period of time and need to be continuously processed during this time. The algorithms used for data processing for the traditional database systems are not suited to tackle complex and various continuous queries over dynamic streaming data. The indexing for finite queries is preferred to indexing on infinite data to avoid expensive operations of index maintenance. Previous related work focused on moving queries on static objects or static queries on moving object. But now-a-days queries as well as objects are dynamic. So, hybrid indexing for queries significantly reduces the space costs and scales well with the increasing data. To deal with the speed of unbounded data, it is necessary to use data parallelism in query processing. The data parallelism in query processing offers better performance, availability and scalability.

Download Full-text