메뉴 건너뛰기




Volumn , Issue , 2008, Pages 89-98

Time-decaying Aggregates in Out-of-order Streams

Author keywords

Asynchronous data streams; Out of order arrivals

Indexed keywords

ASYNCHRONOUS DATA STREAMS; ASYNCHRONY; DATA MANAGEMENTS; DATA QUALITIES; DATA TUPLES; DECAY FUNCTIONS; DETERMINISTIC ALGORITHMS; EXPONENTIAL DECAYS; HEAVY HITTERS; IP TRAFFICS; LARGE DATUMS; OUT-OF-ORDER ARRIVALS; POLYNOMIAL DECAYS; RANGE QUERIES; RELATIVE PERFORMANCES; SENSOR READINGS; SEQUENTIAL EVENTS; SLIDING WINDOWS; TIME STAMPS;

EID: 57349194276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376930     Document Type: Conference Paper
Times cited : (42)

References (27)
  • 1
    • 10744227737 scopus 로고    scopus 로고
    • Aurora: A data stream management system
    • D. Abadi et al. Aurora: a data stream management system. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Abadi, D.1
  • 3
    • 3142749702 scopus 로고    scopus 로고
    • Approximate counts and quantiles over sliding windows
    • A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS, 2004.
    • (2004) PODS
    • Arasu, A.1    Manku, G.S.2
  • 5
    • 1142293244 scopus 로고    scopus 로고
    • Maintaining variance and k-medians over data stream windows
    • B. Babcock, M. Datar, R. Motwani, and L. O'Callaghan. Maintaining variance and k-medians over data stream windows. In PODS, 2003.
    • (2003) PODS
    • Babcock, B.1    Datar, M.2    Motwani, R.3    O'Callaghan, L.4
  • 6
    • 46749111115 scopus 로고    scopus 로고
    • Smooth Histograms for Sliding Windows
    • V. Braverman and R. Ostrovsky Smooth Histograms for Sliding Windows. In FOCS, 2007.
    • (2007) FOCS
    • Braverman, V.1    Ostrovsky, R.2
  • 7
    • 36849066457 scopus 로고    scopus 로고
    • A deterministic algorithm for summarizing asynchronous streams over a sliding window
    • C. Busch and S. Tirthapura. A deterministic algorithm for summarizing asynchronous streams over a sliding window. In STAGS, 2007.
    • (2007) STAGS
    • Busch, C.1    Tirthapura, S.2
  • 8
    • 34250623331 scopus 로고    scopus 로고
    • User-defined aggregate functions: Bridging theory and practice
    • S. Cohen. User-defined aggregate functions: bridging theory and practice. In SIGMOD, 2006.
    • (2006) SIGMOD
    • Cohen, S.1
  • 9
    • 1142287629 scopus 로고    scopus 로고
    • Maintaining time-decaying stream aggregates
    • E. Cohen and M. Strauss. Maintaining time-decaying stream aggregates. In PODS, 2003.
    • (2003) PODS
    • Cohen, E.1    Strauss, M.2
  • 11
    • 33846219851 scopus 로고    scopus 로고
    • Space-and time-efficient deterministic algorithms for biased quantiles over data streams
    • G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Space-and time-efficient deterministic algorithms for biased quantiles over data streams. In PODS, 2006.
    • (2006) PODS
    • Cormode, G.1    Korn, F.2    Muthukrishnan, S.3    Srivastava, D.4
  • 12
    • 52649083637 scopus 로고    scopus 로고
    • Exponentially Decayed Aggregates on Data Streams
    • G. Cormode, F. Korn, and S. Tirthapura. Exponentially Decayed Aggregates on Data Streams. In ICDE, 2008.
    • (2008) ICDE
    • Cormode, G.1    Korn, F.2    Tirthapura, S.3
  • 13
    • 14844367057 scopus 로고    scopus 로고
    • An improved data stream summary: The count-min sketch and its applications
    • G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55(1):58-75, 2005.
    • (2005) Journal of Algorithms , vol.55 , Issue.1 , pp. 58-75
    • Cormode, G.1    Muthukrishnan, S.2
  • 14
    • 33244491040 scopus 로고    scopus 로고
    • Space efficient mining of multigraph streams
    • G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In PODS, 2005.
    • (2005) PODS
    • Cormode, G.1    Muthukrishnan, S.2
  • 15
    • 2442462968 scopus 로고    scopus 로고
    • Maintaining stream statistics over sliding windows
    • M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In SODA, 2002.
    • (2002) SODA
    • Datar, M.1    Gionis, A.2    Indyk, P.3    Motwani, R.4
  • 16
    • 7444250281 scopus 로고    scopus 로고
    • Distributed streams algorithms for sliding windows
    • P. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. Theory of Computing Systems, 37:457-478, 2004.
    • (2004) Theory of Computing Systems , vol.37 , pp. 457-478
    • Gibbons, P.1    Tirthapura, S.2
  • 17
    • 26444529149 scopus 로고    scopus 로고
    • Adaptive spatial partitioning for multidimensional data streams
    • J. Hershberger, N. Shrivastava, S. Suri, and C. Toth. Adaptive spatial partitioning for multidimensional data streams. In ISAAC, 2004.
    • (2004) ISAAC
    • Hershberger, J.1    Shrivastava, N.2    Suri, S.3    Toth, C.4
  • 18
    • 57349084791 scopus 로고    scopus 로고
    • Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error
    • T. Kopelowitz and E. Porat. Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error. In ICTCS, 2005.
    • (2005) ICTCS
    • Kopelowitz, T.1    Porat, E.2
  • 19
    • 34250676594 scopus 로고    scopus 로고
    • A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
    • L.K. Lee and H.F. Ting. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In PODS, 2006.
    • (2006) PODS
    • Lee, L.K.1    Ting, H.F.2
  • 20
    • 28444483527 scopus 로고    scopus 로고
    • Finding (recently) frequent items in distributed data streams
    • A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In ICDE, 2005.
    • (2005) ICDE
    • Manjhi, A.1    Shkapenyuk, V.2    Dhamdhere, K.3    Olston, C.4
  • 22
    • 28444435635 scopus 로고    scopus 로고
    • Data streams: Algorithms and applications
    • S. Muthukrishnan. Data streams: Algorithms and applications. In SODA, 2003.
    • (2003) SODA
    • Muthukrishnan, S.1
  • 23
    • 84872851578 scopus 로고
    • Selection and sorting with limited storage
    • J. I. Munro and M. Paterson. Selection and sorting with limited storage. Theor. Comput. Sci., 12:315-323, 1980.
    • (1980) Theor. Comput. Sci , vol.12 , pp. 315-323
    • Munro, J.I.1    Paterson, M.2
  • 24
    • 84903580652 scopus 로고    scopus 로고
    • Supporting sliding window queries for continuous data streams
    • L. Qiao, D. Agrawal, and A. El Abbadi. Supporting sliding window queries for continuous data streams. In SSDBM, 2003.
    • (2003) SSDBM
    • Qiao, L.1    Agrawal, D.2    El Abbadi, A.3
  • 25
    • 33750403174 scopus 로고    scopus 로고
    • Medians and beyond: New aggregation techniques for sensor networks
    • N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: New aggregation techniques for sensor networks. In ACM SenSys, 2004.
    • (2004) ACM SenSys
    • Shrivastava, N.1    Buragohain, C.2    Agrawal, D.3    Suri, S.4
  • 26
    • 57349194405 scopus 로고    scopus 로고
    • Sketching asycnhronous streams over sliding windows
    • S. Tirthapura, C. Busch, and B. Xu. Sketching asycnhronous streams over sliding windows. In PODC, 2006.
    • (2006) PODC
    • Tirthapura, S.1    Busch, C.2    Xu, B.3
  • 27
    • 0037957068 scopus 로고    scopus 로고
    • Exploiting punctuation semantics in countinuous data streams
    • May
    • P. A. Tucker, D. Maier, T. Sheard, and L. Fegaras. Exploiting punctuation semantics in countinuous data streams. IEEE TKDE, 15(3):555-568, May 2003.
    • (2003) IEEE TKDE , vol.15 , Issue.3 , pp. 555-568
    • Tucker, P.A.1    Maier, D.2    Sheard, T.3    Fegaras, L.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.