| Patent application number | Description | Published |
|---|
| 20080250203 | Wait-free parallel data cache - A system and method for managing a data cache in a central processing unit (CPU) of a database system. A method executed by a system includes the processing steps of adding an ID of a page p into a page holder queue of the data cache, executing a memory barrier store-load operation on the CPU, and looking-up page p in the data cache based on the ID of the page p in the page holder queue. The method further includes the steps of, if page p is found, accessing the page p from the data cache, and adding the ID of the page p into a least-recently-used queue. | 10-09-2008 |
| 20100161569 | METHOD AND SYSTEM FOR DYNAMICALLY PARTITIONING VERY LARGE DATABASE INDICES ON WRITE-ONCE TABLES - Methods and systems for partitioning and dynamically merging a database index are described. A database index includes a single first-level index partition stored in a data cache. As the first-level index partition in the data cache reaches a predetermined size, it is copied to secondary storage and a new index partition is generated in the data cache. When the number of index partitions in secondary storage reaches some predetermined number, the index partitions are merged to create a single index partition of a higher level in a hierarchy of index partitions having an exponentially increasing size with each increase in level within the hierarchy. | 06-24-2010 |
| 20100287346 | METHOD AND SYSTEM FOR MANAGING LARGE WRITE-ONCE TABLES IN SHADOW PAGE DATABASES - Methods and systems for managing large write-once tables are described. In some embodiments, a relational database management system includes a space allocation module that utilizes both a logical space allocation scheme, as well as a physical space allocation scheme, to allocate space in units (e.g., pages) having two different sizes—small pages and big pages. For instance, small pages are logically allocated with a conventional converter module, which manages a converter table for mapping logical pages to physical pages, while big pages are physically allocated with an object directory manager, which manages big objects comprised of big pages. | 11-11-2010 |
| 20110022805 | Wait-Free Parallel Data Cache - A system and method for managing a data cache in a central processing unit (CPU) of a database system. A method executed by a system includes the processing steps of adding an ID of a page p into a page holder queue of the data cache, executing a memory barrier store-load operation on the CPU, and looking-up page p in the data cache based on the ID of the page p in the page holder queue. The method further includes the steps of, if page p is found, accessing the page p from the data cache, and adding the ID of the page p into a least-recently-used queue. | 01-27-2011 |
| 20120096040 | METHOD AND SYSTEM FOR MANAGING LARGE WRITE-ONCE TABLES IN SHADOW PAGE DATABASES - Methods and systems for managing large write-once tables are described. In some embodiments, a relational database management system includes a space allocation module that utilizes both a logical space allocation scheme, as well as a physical space allocation scheme, to allocate space in units (e.g., pages) having two different sizes—small pages and big pages. For instance, small pages are logically allocated with a conventional converter module, which manages a converter table for mapping logical pages to physical pages, while big pages are physically allocated with an object directory manager, which manages big objects comprised of big pages. | 04-19-2012 |
| Patent application number | Description | Published |
|---|
| 20090249315 | OBJECT STORAGE AND SYNCHRONIZATION HOOKS FOR OCCASIONALLY-CONNECTED DEVICES - A system may include an application programming interface (API) layer, a cache layer, and an object storage/access layer. The API layer may expose an interface to store a business object and an interface to retrieve the business object, and may transmit a request to store the business object and a request to retrieve the business object, and the cache layer may cache the business object and transmit the request to store the business object and the request to retrieve the business object. The object storage/access layer may receive the request to store the business object and, in response to the request to store the business object, to invoke a serialization method exposed by the business object to store the data associated with the object in a data structure. The object storage/access layer may also receive the request to retrieve the business object and, in response to the request to retrieve the business object, to invoke a deserialization method of the business object to deserialize the data associated with the business object in the data structure. | 10-01-2009 |
| 20100198785 | SELECTIVELY TRANSMITTING TRANSACTION DATA - A last transaction for a business object may be identified. Transactions related to that occur prior to the last transaction and subsequent to a last upload event are associated with the last transaction. Data describing the last transaction and the associated transactions may be transmitted over a communications network. Related apparatuses, techniques, systems, computer program products are also described. | 08-05-2010 |
| 20120124216 | ADDRESS GENERATION AND CLUSTER EXTENSION IN DISTRUBTED SYSTEMS USING TREE METHOD - Methods and apparatus, including computer program products, for managing a cluster of servers organized into nodes. A method of one aspect includes establishing a cluster; establishing a set of ultimate identifiers for nodes resulting from splitting in the cluster; and storing every new data object on a node that has a node identifier that identifies a subset of the set of ultimate identifiers, and providing for the object a universal identifier that combines (i) an object identifier that is unique on the node and (ii) a server identifier that is one of the ultimate identifiers in the subset. A method of another aspect includes generating for a new data object a universal identifier that has a node identifier part that uniquely identifies a node, a reserve part generated at least in part as a pseudo-random value, and an object identifier part that uniquely identifies the object in the node. | 05-17-2012 |
