DSpace Repository

Queueing Analysis of Relational Operators for Continuous Data Streams

Show simple item record

dc.contributor.author Jiang Qingchun
dc.contributor.author Chakravarthy Sharma
dc.date.accessioned 2018-01-22T17:24:30Z
dc.date.available 2018-01-22T17:24:30Z
dc.date.issued 2003
dc.identifier.uri http://hdl.handle.net/123456789/6922
dc.description.abstract Currently, stream data processing is an active area of research , which includes everything from algorithms and ar-chitectures for stream processing to modelling, and analysis of various components of a stream processing system. In this paper, we present an analysis of relational operators used for stream processing using queueing theory and study behaviors of streaming data in a query processing system. Our approach enables us to compute the fundamental performance metrics of relational operators — select, project, and join over data streams. Furthermore, this approach establishes a way to find the probability distribution functions of both the number of tuples and the waiting time of tuples in the system. Finally, we designed and implemented a number of experiments to validate the accuracy and effectiveness of our analysis.
dc.format application/pdf
dc.title Queueing Analysis of Relational Operators for Continuous Data Streams
dc.type generic


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account