# US 2012/0254249 A1 · Database Management System

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254249 A1
- Document ID: US20120254249A1
- Status: Published application
- Kind: A1
- Application number: 13/525,953
- Filed: 2012-06-18
- Published: 2012-10-04
- Earliest claimed: 2011-03-18
- Assignees: NuoDB, Inc.
- Inventors: James A. Starkey
- Web page: https://patentgrep.com/patent/US20120254249A1

## CPC

- G06F 16/278: {Data partitioning, e.g. horizontal or vertical partitioning}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A multi-user, elastic, on-demand, distributed relational database management system. The database is fragmented into distributed objects called atoms. Any change to a copy of an atom at one location is replicated to all other locations containing a copy of that atom. Transactional managers operate to satisfy the properties of atomicity, consistency, isolation and durability.

## Claims

### Claim 1

A database management system for a logical database comprised of data records organized into tables to be accessed from multiple transactional nodes that process transactions related to the logical data base, said system comprising:
A) means for parsing the database into fragments wherein each fragment stores a portion of the metadata and/or data pertaining to the logical data base for transfer within the database management system as serialized messages and for storage as a de-serialized message,
B) at least one archival node that stores all the fragments in a de-serialized form in permanent storage thereby to constitute a single store for the entire data base, wherein each transactional node comprises:
i) means for responding to queries from users by establishing a sequence of low-level commands for identifying fragments that are relevant to the query,
ii) means for responding to the low-level commands by obtaining only those copies of existing fragments that are relevant to the query being processed thereat whereby a given fragment might exist at some other node or only at an archival node, and
iii) means for replicating any changed fragment to the at least one archival node and each transactional node in which a copy of that fragment resides whereby changes are made to fragments in other nodes on a peer-to-peer basis and whereby any transactional node only contains those fragments that pertain to the queries being made users accessing the data base through that transactional node.
