Distributed collaborative editing systems allow users to work distributed in time, space and across organizations. Trending editors such as Google Docs, Etherpad or Git have grown popularity over the years. A new kind of based on a family data structure replicated several sites called Conflict-free Replicated Data Type (CRDT for short) appeared recently. This paper considers CRDT that represents sequence basic elements can be lines, words characters (sequence CRDT). The possible operations...

Real-time collaborative editors are common tools for distributing work across space, time, and organizations. Unfortunately, mainstream such as Google Docs rely on central servers raise privacy scalability issues. CRATE is a real-time decentralized editor that runs directly in web browsers thanks to WebRTC. Compared state-of-the-art, the first only requires order support editing transparently handle from small large groups of users. Consequently, can also be used massive online lectures, TV...

Collecting statistics from online public SPARQL endpoints is hampered by their fair usage policies. These restrictions hinder several critical operations, such as aggregate query processing, portal development, and data summarization. Online sampling enables the collection of while respecting However, has not yet been integrated into standard. Although integrating standard appears beneficial, its effectiveness must be demonstrated in a practical semantic web context. This paper investigates...

Many distributed protocols and applications rely on causal broadcast to ensure consistency criteria. However, none of causality tracking state-of-the-art approaches scale in large dynamic systems. This paper presents a new non-blocking protocol suited for such The proposed outperforms size messages, execution time complexity, local space complexity. Most importantly, messages piggyback control information the which is constant. We prove that both static Consequently, systems can finally...

Summary Distributed real‐time editors made editing easy for millions of users. However, main stream rely on Cloud services to mediate sessions raising privacy and scalability issues. Decentralized tackle issues, but issues remain. We aim build a decentralized editor that allows anytime, anywhere, whatever is the number participants. In this study, we propose an approach based massively replicated sequence data structure represents shared document. establish original trade‐off communication,...

Processing SPARQL queries over large federations of endpoints is crucial for keeping the Semantic Web decentralized.Despite existence hundreds endpoints, current federation engines only scale to dozens.One major issue comes from definition source selection problem, i.e., finding minimal set contact per triple pattern.Even if such a minimal, few combinations sources may return results.Consequently, most query processing time wasted evaluating that no results.In this paper, we introduce...

Processing SPARQL queries over large federations of endpoints is essential for maintaining the Semantic Web decentralized. However, existing federation engines struggle to query more than a dozen endpoints. We recently proposed FedUP, new type engine based on unions-over-joins plans that outperforms state-of-the-art by orders magnitude federations. This demonstration paper introduces Fediscount, federated online shopping application FedShop benchmark, illustrating capabilities FedUP. The...

Many distributed protocols and applications rely on causal broadcast to ensure consistency criteria. However, none of causality tracking state-of-the-art approaches scale in large dynamic systems. This paper presents a new non-blocking protocol suited for The proposed outperforms size messages, execution time complexity, local space complexity. Most importantly, messages piggyback control information the which is constant. We prove that both static Consequently, systems can finally afford broadcast.