Service Mesh的延伸 — 论道Database Mesh
支持任意数据库 • 数据库连接数占用高 • 仅支持单一开发语言 • 性能损耗低 • 无中心化 代理端 • 仅支持单一数据库 • 数据库连接数占用低 • 支持任意开发语言 • 性能损耗高JDBC Proxy Sidecar 数据库 任意 单一 单一 连接数 高 低 高 异构语言 仅Java 任意 任意 性能 损耗低 损耗略高 损耗低 无中心化 是 否 是 静态入口 无 有 无 无 Sidecar的优势Database Mesh架构图Sharding-Sphere 核心功能 数据分片 分布式事务 数据库治理 弹性伸缩 管控界面 实现方案 Sharding-JDBC Sharding-Proxy Sharding-Sidecar Sharding -Sphere 云原生 无中心 零侵入Sharding-Sphere:数据分片Sharding-Sphere:分布 •ZooKeeper •Etcd 业务代码 Sharding- Sphere 业务代码 Sharding- Sphere 应用 应用 注册中心Sharding-Sphere:APM演进线路图 JDBC + 数据分片 版本:1.X 数据库治理 版本:2.X Proxy 版本:3.0.X 分布式事务 版本:3.1.X Sidecar 版本:4.0.X 多数据副本 版本:4.1.X0 码力 | 35 页 | 4.56 MB | 5 月前3CppCon 2021: Persistent Data Structures
Introduction Persistent Memory Use-Cases Pitfalls Persistent Hash Map Design Goals and Methodology Persistence Performance Results Persistent Transactional Data Structures Design Goals Methodology Performance Structures Live Demonstration References Persistent Hash Map Design Goals ▶ Read optimized ▶ Persistence needs no flush or fence after first read ▶ Runtime over recovery ▶ Persist as little as possible Persistent Hash Map Persistent Transactional Data Structures Live Demonstration References Persistence ▶ Goal: Add persistence to concurrent data structures ▶ Leverage existing multithreaded synchronization guarantees0 码力 | 56 页 | 1.90 MB | 5 月前3Embracing an Adversarial Mindset for Cpp Security
Privilege Escalation Persistence & Evasion Command & Control Lateral Movement ExfiltrationWhy Elevation of Privilege (EoP)? ● Crucial for lateral movement ● Persistence and evading detection Defense-in-DepthAttack Chain and EoP Reconnaissance Intrusion Exploitation Privilege Escalation Persistence & Evasion Command & Control Lateral Movement ExfiltrationWhy Security Feature Bypasses? ● Chain and Security Feature Bypass Reconnaissance Intrusion Exploitation Privilege Escalation Persistence & Evasion Command & Control Lateral Movement ExfiltrationNotable Exploits Used in the Wild0 码力 | 92 页 | 3.67 MB | 5 月前3Back to Basics: Designing Classes (part 1 of 2)
classes for easy change. Guideline: Design classes for easy extensions.Our Second Toy Problem: Persistence Systems 50 class PersistenceInterface { public: PersistenceInterface(); virtual ~ ( Blob& blob, ReadCallback callback, uint timeout ) = 0; // ... };Our Second Toy Problem: Persistence Systems 51 class PersistenceInterface { public: PersistenceInterface(); virtual ~0 码力 | 87 页 | 5.64 MB | 5 月前3Using Modern C++ to Build XOffsetDatastructure
summarizes all these methods: Traversal-Based Serialization. • CppCon 16 Lightweight Object Persistence With Relocatable Heaps in Modern C++ by Bob Steagall Fanchen Su, XOffsetDatastructure, CppCon • CppCon 17 How to Write a Custom Allocator by Bob Steagall • CppCon 16 Lightweight Object Persistence With Relocatable Heaps in Modern C++ by Bob Steagall Fanchen Su, XOffsetDatastructure, CppCon0 码力 | 111 页 | 3.03 MB | 5 月前3Best practices for building Kubernetes Operators
controller is a piece of code that intercepts requests to the Kubernetes API server prior to persistence of the object, but after the request is authenticated and authorized.” ● Validating Admission0 码力 | 36 页 | 2.19 MB | 5 月前3Julia 1.11.4
dictionary implemented as an hash array mapped trie, which is optimal for situa- tions where you need persistence, each operation returns a new dictionary separate from the previousCHAPTER 43. COLLECTIONS AND0 码力 | 2007 页 | 6.73 MB | 3 月前3Julia 1.11.5 Documentation
dictionary implemented as an hash array mapped trie, which is optimal for situa- tions where you need persistence, each operation returns a new dictionary separate from the previousCHAPTER 43. COLLECTIONS AND0 码力 | 2007 页 | 6.73 MB | 3 月前3Julia 1.11.6 Release Notes
dictionary implemented as an hash array mapped trie, which is optimal for situa- tions where you need persistence, each operation returns a new dictionary separate from the previousCHAPTER 43. COLLECTIONS AND0 码力 | 2007 页 | 6.73 MB | 3 月前3julia 1.13.0 DEV
dictionary implemented as an hash array mapped trie, which is optimal for situa- tions where you need persistence, each operation returns a new dictionary separate from the previous one, but the underlying implementation0 码力 | 2058 页 | 7.45 MB | 3 月前3
共 14 条
- 1
- 2