In this keynote I give a subjective but systematic overview of the landscape of distributedevent-basedsystems, with an emphasis on two areas I have worked on over the last decade: large-scale stream processing with ...
详细信息
StreamToxWatch, or ToxWatch for short, is an early-stage ensemble architecture for data poisoning detection and monitoring in online learning systems over streams. Detecting data poisoning is difficult, especially in ...
详细信息
In event processing systems, detected event patterns can reveal privacy-sensitive information. In this paper, we propose and discuss how to integrate pattern-level privacy protection in event-basedsystems. Compared t...
详细信息
the unprecedented scale, speed, and scope of interconnectivity, ranging from the microsensors on the edge to the global networks, will be the prominent characteristics of the emerging computing environments. Our curre...
详细信息
In ubiquitous computing and the Internet of things, devices monitor the environment and supply data to applications that assist people or export results for other services. Given the distributed nature of such systems...
详细信息
event sourcing is increasingly used and implemented in event-basedsystems for maintaining the evolution of application state. However, unbounded event logs are impracticable for many systems, as it is difficult to al...
详细信息
ISBN:
(纸本)9781450357821
event sourcing is increasingly used and implemented in event-basedsystems for maintaining the evolution of application state. However, unbounded event logs are impracticable for many systems, as it is difficult to align scalability requirements and long-term runtime behavior withthe corresponding storage requirements. To this end, we explore the design space of log pruning approaches suitable for event-sourced systems. Furthermore, we survey specific log pruning mechanisms for event-sourced logs. In a brief evaluation, we point out the trade-offs when applying pruning to event logs and highlight the applicability of log pruning to event-sourced systems.
distributedevent-sourced systems adopt a fairly new architectural style for data-intensive applications that maintains the full history of the application state. However, the performance implications of such systems ...
详细信息
ISBN:
(纸本)9781450357821
distributedevent-sourced systems adopt a fairly new architectural style for data-intensive applications that maintains the full history of the application state. However, the performance implications of such systems are not yet well explored, let alone how the performance of these systems can be improved. A central issue is the lack of systematic performance engineering approaches that take into account the specific characteristics of these systems. To address this problem, we suggest a methodology for performance engineering and performance analysis of distributedevent-sourced systemsbased on specific measurements and subsequent, targeted optimizations. the methodology blends in well into existing software engineering processes and helps developers to identify bottlenecks and to resolve performance issues. Using our structured approach, we improved an existing event-sourced system prototype and increased its performance considerably.
Stateful applications are based on the state they hold and how it changes over time. this history of state changes is usually discarded as the application progresses. By building on concepts from event processing and ...
详细信息
ISBN:
(纸本)9781450357821
Stateful applications are based on the state they hold and how it changes over time. this history of state changes is usually discarded as the application progresses. By building on concepts from event processing and storing the application history, we envision a novel programming paradigm that supports retroaction. Retroactive computing introduces new opportunities for a developer to access and even modify an application timeline. By enabling the exploration of alternative scenarios, retroactive computing establishes powerful new ways to debug systems and introduces new approaches to solve problems. Initial work has shown the practicality and possibilities of this new programming paradigm and introduces further research questions and challenges.
In this paper, we develop a novel MO-DCOP algorithm based on dynamic programming techniques which guarantees to find the complete Pareto front. We also propose a bounded version which reduces the size of the messages ...
详细信息
ISBN:
(纸本)9781450356497
In this paper, we develop a novel MO-DCOP algorithm based on dynamic programming techniques which guarantees to find the complete Pareto front. We also propose a bounded version which reduces the size of the messages using an adjustable parameter.
How can we perform similarity joins of multi-dimensional streams in a distributed fashion, achieving low latency? Can we adaptively repartition those streams in order to retain high performance under concept drifts? C...
详细信息
暂无评论