Time-slide window join over data streams

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 361
  • Download : 0
The join is an important operator in processing data streams. To produce outputs continuously over unbounded data streams, sliding windows are generally used to limit the scope of the join at a certain time. In the existing join algorithms, only a simple type of windows have been considered, which are updated whenever a new data item arrives on any input stream. On the other hand, a more common type of windows have not been addressed yet, whose intervals are updated periodically, i.e., slid by a predefined time interval. In this paper, we consider the time-slide windows in joining multiple data streams. The algorithm for the time-slide window join can vary according to (i) how frequently the join is evaluated and (ii) which structure is used for windowing. Regarding this, possible algorithms are discussed, and experimental results that compare their performances are provided in this paper.
Publisher
SPRINGER
Issue Date
2014-10
Language
English
Article Type
Article
Keywords

MULTIPLE DATA STREAMS; MANAGEMENT; SEMANTICS

Citation

JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, v.43, no.2, pp.323 - 347

ISSN
0925-9902
DOI
10.1007/s10844-014-0325-4
URI
http://hdl.handle.net/10203/192756
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0