Co-ordination of Streams of Data

Abstract

Here in this thesis work we have proposed a model for some issues from a new data processing model. In this type of model data we are dealing with does not possess any relation that is persistent, rather this data have some different properties. They arrive in real time, continuous, time varying, rapid and infinite streams of data. This paper introduces a model for the delayed and unordered arrival of streams. In addition, this thesis work also introduces the concept of using buffers and algorithmic issues for stream management purpose reviewing the past related works and also the ongoing research in this area. This thesis proposes a model and an algorithm that will deal with the coordination of the tuples that do not arrive in due time and in some cases they just lost forever. The model introduces some modules that will depict the total work flow and the algorithm will propose some data set that will enable one to choose the tradeoff depending on the system requirements implementing the ordering mechanism.