Semantics of Spatially-Aware Windows Over Streaming Moving Objects

Several window constructs are usually specified in continuous queries over data streams as a means of limiting the amount of data processed each time and thus providing real-time responses. Current research has mostly focused on tackling the temporal volatility of the stream, overlooking other inherent features of incoming items. In this paper, we argue that novel window types, other than strictly temporal, can also prove adequate in providing finite portions of multidimensional streams. We systematically examine the particular case of spatiotemporal streams generated from moving point objects and we introduce a comprehensive classification of window variants useful in expressing the most common operations, such as range or nearest- neighbor search. Our investigation also demonstrates that composite windows, combining temporal and spatial properties, can effectively capture the evolving characteristics of trajectories and assist significantly in query specification.

[1]  David Maier,et al.  Semantics and evaluation techniques for window aggregates in data streams , 2005, SIGMOD '05.

[2]  Frederick Reiss,et al.  TelegraphCQ: Continuous Dataflow Processing for an Uncertain World , 2003, CIDR.

[3]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[4]  Yuan-Ko Huang,et al.  Scalable Processing of Continuous K-Nearest Neighbor Queries with Uncertainty in Spatio-Temporal Databases , 2009, 2009 International Conference on Research Challenges in Computer Science.

[5]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[6]  Kyriakos Mouratidis,et al.  Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.

[7]  Jennifer Widom,et al.  The CQL continuous query language: semantic foundations and query execution , 2006, The VLDB Journal.

[8]  Nikos Pelekis,et al.  Nearest Neighbor Search on Moving Object Trajectories , 2005, SSTD.

[9]  Timos K. Sellis,et al.  Window Specification over Data Streams , 2006, EDBT Workshops.

[10]  Michael Stonebraker,et al.  The 8 requirements of real-time stream processing , 2005, SGMD.

[11]  Timos K. Sellis,et al.  Managing Trajectories of Moving Objects as Data Streams , 2004, STDBM.

[12]  Walid G. Aref,et al.  SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).

[13]  Frederick Reiss,et al.  TelegraphCQ: continuous dataflow processing , 2003, SIGMOD '03.

[14]  Qiang Chen,et al.  Aurora : a new model and architecture for data stream management ) , 2006 .

[15]  Marios Hadjieleftheriou,et al.  Time relaxed spatiotemporal trajectory joins , 2005, GIS '05.

[16]  Marios Hadjieleftheriou,et al.  Efficient trajectory joins using symbolic representations , 2005, MDM '05.

[17]  Xiaohui Yu,et al.  Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).

[18]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.