By Topic

On-Line Data Stream Query Processing Using Finite State Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ali A. Safaei ; Dept. of Comput. Eng., Iran Univ. of Sci. & Technol., Tehran, Iran ; Mostafa S. Haghjoo ; Mohamad Ghalambor ; Fatemeh Abdi

In data stream systems, data does not appear in form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying streams. Although, the nature of data streams is on-line, the well-known data stream models don't consider on-line query processing. This is a major deficit in these environments. In this paper an on-line query processing model for data streams is presented in which finite state automata is used. Architecture of the proposed query processing model, structure of the finite state automata, and relevant algorithms for on-line data stream query processing are presented. It is tested using an on-line auction environment and its performance in term of response time, tuple latency, number of operations and required memory space is evaluated and compared with the existing system via simulation.

Published in:

Cooperation and Promotion of Information Resources in Science and Technology, 2009. COINFO '09. Fourth International Conference on

Date of Conference:

21-23 Nov. 2009