ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
I am designing a backup and recovery runbook for a YugabyteDB universe (assume 2.18 or later) and need to reason precisely about transactional consistency at the snapshot boundary. My understanding is that a backup captures a consistent distributed snapshot using the hybrid logical clock (HLC) at backup start time, and that restore replays that snapshot into
Locking Behavior in XA Transactions Oracle Database utilizes Interested Transaction Lists (ITL) in data block headers to manage row-level locking. While standard local transactions release locks immediately upon a COMMIT or ROLLBACK, distributed transactions utilizing the XA standard involve a two-phase commit (2PC) process. In a distributed environment, a t
Goal: ensure that cancelling a long‑running YSQL statement also aborts any associated distributed transaction promptly across all tablet leaders, preventing stale locks that could block concurrent workloads. Constraints: statement_timeout is automatic and scoped to a single statement but counts network latency toward the timeout, which can cause false‑positi
YugabyteDB employs a distributed deadlock detection mechanism utilizing a Wait-for-Graph (WFG) to identify cyclic dependencies across transactions. While the system integrates priority schemes like Wound-Wait to prevent certain deadlock scenarios, complex distributed transactions involving multiple tablets still rely on the WFG to resolve circular blocks. In
yugabytedb