Slider: Incremental sliding window analytics

Proceedings of the 15th International Middleware Conference, Middleware 2014

Volumn , Issue , 2014, Pages 61-72

  Bhatotia, Pramod ^a   Junqueira, Flavio P ^b   Acar, Umut A ^c   Rodrigues, Rodrigo ^d  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b MICROSOFT RESEARCH   (United States)

^c INRIA   (France)

^d UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMS; DATA STRUCTURES; FORESTRY; MIDDLEWARE;

APPLICATION CODES; APPLICATION SPECIFIC; DATA DEPENDENCE GRAPHS; INTERMEDIATE STATE; NOVEL TECHNIQUES; OVERLAPPING WINDOW; PERFORMANCE GAIN; SPLIT PROCESSING;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTATION; DATA; TREES;

EID: 84920425359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2663165.2663334     Document Type: Conference Paper

References (42)

1. Apache Hadoop: http://hadoop. apache. org.
2. Apache PigMix: http://wiki. apache. org/pig/PigMix.
3. Apache S4: http://incubator. apache. org/s4.
4. Asymptotic analysis of self-adjusting contraction trees: http://www. mpi-sws. org/-bhatotia/publications.
5. Storm: http://storm-project. net.
6. Trident: http://storm. incubator. apache. org/.
7. Wikipedia dataset: http://wiki. dbpedia. org.
8. U. A. Acar. Self-Adjusting Computation. PhD thesis, Carnegie Mellon University, 2005.
9. U. A. Acar, G. E. Blelloch, M. Blume, R. Harper, and K. Tangwongsan. An experimental analysis of self-adjusting computation. ACM TOPLAS, 2009.
10. U. A. Acar, G. E. Blelloch, and R. D. Blumofe. The Data Locality of Work Stealing. In SPAA, 2000.
11. U. A. Acar, G. E. Blelloch, R. Ley-Wild, K. Tangwongsan, and D. Tilrkoglu. Traceable data types for self-adjusting computation. In ACM PLD1, 2010.
12. P. Aditya, M. Zhao, Y. Lin, A. Haeberlen, P. Draschel, B. Maggs, and B. Wishon. Reliable Client Accounting for P2P-Infrastructure Hybrids. In NSD1, 2012.
13. G. Ananthanarayanan, A. Ghodsi, A. Wang, D. Borthakur, S. Shenker, and I. Stoica. PACMan: Coordinated Memory Caching for Parallel Jobs. In NSD1, 2012.
14. Ananthanarayanan et al. Photon: Fault-tolerant and Scalable Joining of Continuous Data Streams. In SICMOD, 2013.
15. M. Balazinska, H. Balakrishnan, S. Madden, and M. Stone-braker. Fault-Tolerance in the Borealis Distributed Stream Processing System. In SICMOD, 2005.
16. P. Bhatotia, R. Rodrigues, and A. Verma. Shredder: GPU-Accelerated Incremental Storage and Computation. In FAST. 2012.
17. P. Bhatotia, A. Wieder, I. E. Akkus, R. Rodrigues, and U. A. Acar. Large-scale incremental data processing with change propagation. In HotCloud, 2011.
18. P. Bhatotia, A. Wieder, R. Rodrigues, U. A. Acar, and R. Pasquini. Incoop: MapReduce for Incremental Computations. In SoCC, 2011.
19. Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst. HaLoop: Efficient Iterative Data Processing on Large Clusters. In VLDB, 2010.
20. C. Olston et al. Pig Latin: A Not-So-Foreign Language for Data Processing. In SICMOD, 2008.
21. C. Olston et al. Nova: Continuous Pig/Hadoop Workflows. In SICMOD, 2011.
22. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, 1992.
23. T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, K. Elmeleegy, and R. Sears. MapReduce Online. In NSDl. 2010.
24. J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDl, 2004.
25. C. Demetrescu, I. Finocchi, and G. Italiano. Handbook on Data Structures and Applications.
26. M. Dischinger, M. Marcon, S. Guha, K. P. Gummadi, R. Ma-hajan, and S. Saroiu. Glasnost: Enabling End Users to Detect Traffic Differentiation. In NSDl, 2010.
27. P. K. Gunda, L. Ravindranath, C. A. Thekkath, Y. Yu, and L. Zhuang. Nectar: Automatic Management of Data and Computation in Datacenters. In OSDl, 2010.
28. B. He, M. Yang, Z. Guo, R. Chen, B. Su, W. Lin, and L. Zhou. Comet: Batched Stream Processing for Data Intensive Distributed Computing. In SoCC, 2010.
29. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks. In EuroSys, 2007.
30. D. Logothetis, C. Olston, B. Reed, K. Web, and K. Yocum. Stateful bulk processing for incremental analytics. In SoCC. 2010.
31. M. Ali et al. Microsoft CEP server and online behavioral targeting. In VLDB, 2009.
32. M. Zaharia et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In NSDl, 2012.
33. D. G. Murray, F. McSherry, R. Isaacs, M. Isard, P. Barham, and M. Abadi. Naiad: A Timely Dataflow System. In SOSP. 2013.
34. D. Peng and F. Dabek. Large-scale Incremental Processing Using Distributed Transactions and Notifications. In OSDL 2010.
35. L. Popa, M. Budiu, Y. Yu, and M. Isard. Dryadlnc: Reusing work in large-scale computations. In HotCloud, 2009.
36. W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. In CACM, 1990.
37. G. Ramalingam and T. Reps. A Categorized Bibliography on Incremental Computation. In POPL, 1993.
38. T. Rodrigues, F. Benevenuto, M. Cha, K. Gummadi, and V. Almeida. On Word-of-Mouth Based Discovery of the Web. In IMC, 2011.
39. M. A. Shah, J. M. Hellerstein, and E. Brewer. Highly available, fault-tolerant, parallel dataflows. In SICMOD, 2004.
40. Z. Qian et al. TimeStream: Reliable Stream Computation in the Cloud. In EuroSys, 2013.
41. M. Zaharia, T. Das, H. Li, T. Hunter, S. Shenker, and I. Stoica. Discretized Streams: Fault-Tolerant Streaming Computation at Scale. In SOSP, 2013.
42. M. Zaharia, A. Konwinski, A. D. Joseph, R. Katz, and I. Stoica. Improving MapReduce Performance in Heterogeneous Environments. In OSDl, 2008.