Fast (low nanoseconds) and scalable protection. • Supports arbitrary protection duration (e.g., the user-defined fn is allowed to block or take long time) Asynchronous Reclamation • Asynchronous reclamation when A is reclaimed. • User removes A (implicitly removing B) • A has no more inbound links. A is automatically retired. • User removes all objects with dependence on resource X. • User calls hazard_pointer_clean_up before invoking global cleanup. • Repeat as needed if the indicator is set. • Problem: Where is user code? In User Code • Integrated link counting. • Automatically repeat global cleanup if dependent retirement

summaries from Raw Events You can’t recover Raw Events from Summaries Audit Trace Application/User Path © 2018 Percona. 6 Why Not ? Generating Full Query Logs can be Expensive Logs can Consume Logs Audit Database Access Have Limited Level of Details Allows extensive filtering by Object, User Account etc Has information about Connection Events Available in MySQL Enterprise, Percona Server "sqltext":"SELECT SUM(k) FROM sbtest1 WHERE id BETWEEN 3 AND 102","user":"sbtest[sbtest] @ localhost []","host":"localhost","os_user":"","ip":"","db":"sbtest"}} © 2018 Percona. 19 Percona Server Configuration

model has been at the end. A New Proposal: Open Data Application The Road to Open Web ➔ From the user side, it looks like just the traditional Internet app ➔ But everyone have the chance to download/sync app 1 app 2 app 3 app n Every app has its own backend and frontend implementations. General User Text Persistence protocol https://github.com/eightfish-org/gutp A Case: GUTP MeBlog is a blog platform attract more parties to run steady and persistent nodes for this platform? Two Major Problems ➔ End user drives, no security (or token fund) drives. ➔ Network is like a living creature, it will evolve –

mongodb, redis Listen: binlog, // binlog, kafka DataSource: user:pass@tcp(example.com:3306)/user, Table: user, QueryKeys: [ // usually primary key id

SENDER/RECEIVER AND CANCELLATION • Orchestrating cancellation is the job of the algorithms, not the user. • Only algorithms that introduce concurrency need to handle cancellation. • Cancellation is asynchronous // with the result of `task` when both operations complete. // process input in a loop until the user interrupts: sender auto work_loop = unifex::stop_when( unifex::repeat_effect( processInput() keyboard sender and op state such that: • ...the sender’s connect() returns the op state wrapping the user’s receiver. • ...the op state’s start() places a callback that completes the receiver in a global

constexpr has steadily increased in power • It's just code that runs on your machine instead of the user's • Example: lookup tables • Everyone uses lookup tables • Arrays are maximally space-efficient constructor is powered by C++20 ranges! • Specifically ranges::contiguous_range (and more) • Extensible to user-defined contiguous ranges25 And More!26 So Many New Features, Including: • atomic>

High Availability • HA support Helm Chart Support • Helm Chart repository • Same mechanism and user experiences with image management Multi Deployments • Docker Compose • BOSH/Pivotal Tile • Helm

Replica 2 Shard 2 Replica 1 Shard 2 Replica 2 Replica Service Replica Service Replica Service User Config Map Common Config Map Stateful Set Pod Persistent Volume Claim Persistent Volume

bits, ratio_divide>>;16 Durations – Predefined & Literals  Standard user-defined duration literals:  h, min, s, ms, us, and ns  Require any of the following using directives: