Jump to content

18989738. MULTI-SHARD TRANSACTIONS IN A BYZANTINE COMPUTING ENVIRONMENT (The Regents of the University of California)

From WikiPatents
Revision as of 09:32, 22 April 2025 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

MULTI-SHARD TRANSACTIONS IN A BYZANTINE COMPUTING ENVIRONMENT

Organization Name

The Regents of the University of California

Inventor(s)

Mohammad Sadoghi Hamedani of Davis CA US

Jelle Antonius Johannes Hellings of Hamilton CA

Suyash Gupta of Fremont CA US

Sajjad Rahnama of Davis CA US

MULTI-SHARD TRANSACTIONS IN A BYZANTINE COMPUTING ENVIRONMENT

This abstract first appeared for US patent application 18989738 titled 'MULTI-SHARD TRANSACTIONS IN A BYZANTINE COMPUTING ENVIRONMENT

Original Abstract Submitted

In a Byzantine computing environment in which a database is sharded or partitioned among multiple clusters of computing nodes, consensus for and execution of data transactions (e.g., transactions that require and/or affect data of one or more shards) are achieved in a resilient manner. Within some clusters, multiple primary replicas concurrently propose transactions for processing in parallel by all replicas. For some multi-shard transactions, shards involved in the transactions may be logically ring-ordered; each shard in turn achieves consensus among its nodes to commit the transactions, and then executes its portion of the operation after consensus is obtained among all shards. For some other multi-shard transactions, involved shards first determine whether local data constraints are satisfied, after which data modifications are made in parallel.

(Ad) Transform your business with AI in minutes, not months

Custom AI strategy tailored to your specific industry needs
Step-by-step implementation with measurable ROI
5-minute setup that requires zero technical skills
Get your AI playbook

Trusted by 1,000+ companies worldwide

Cookies help us deliver our services. By using our services, you agree to our use of cookies.