Database management methodology
AssigneeSony Ericsson Mobile Communications AB
InventorMilan RAKIC
Life of this patent
Estimating the term…
Abstract
A method and system for enabling enhanced memory management are provided. A cache memory may be populated with a sorted list of data elements corresponding to a number of oldest records in a database. Upon receipt of a request to add a record to a full database, the cache may be examined to determine the oldest record in the database. The record may be deleted and the corresponding data element in the cache may be removed from the sorted listing and associated with a floating data element pointer.
Claims27
A method, comprising:
- populating a cache with a plurality of data elements pointing to a plurality of records in a memory structure;
- identifying a data element pointing to an oldest record in the memory structure;
- removing the oldest record from the memory structure;
- and
- removing the data element pointing to the oldest record in the memory structure from the cache.
A method, comprising:
- populating a cache with a plurality of data elements pointing to a plurality of records in a memory structure;
- receiving a request to update a record from the memory structure;
- determining whether an age of the record to be updated is more recent than an age of the most recent node in a plurality of nodes;
- and
- determining whether a node in the plurality of data elements is associated with the record to be deleted when it is determined that the age of the record to be updated is not more recent than the most recent node in a plurality of nodes.
A computer-readable medium having stored thereon sequences of instructions executable by at least one processor, comprising:
- one or more instructions for receiving a request to add a record to a database;
- one or more instructions for determining whether the database is full;
- one or more instructions for identifying a data element in a cache memory pointing to an oldest record in the database when it is determined that the database is full;
- one or more instructions for removing the oldest record from the database;
- one or more instructions for removing the identified data element in the cache memory;
- and
- one or more instructions for adding the record to the database.
A method, comprising:
- receiving a request to add a node to a sorted list of nodes,
- wherein the sorted list of nodes is sorted based on timestamps associated with the nodes, with a head node representing an oldest node in the sorted list and a tail node representing a newest node in the sorted list;
- determining whether the node to be added is older than the tail node;
- assigning a floating pointer to the tail node when it is determined that the node to be added is older than the tail node in the sorted list;
- rewriting the tail node to represent the node to be added;
- rewriting a tail pointer to point to a next newest node in the sorted list;
- identifying a sorted position for the node to be added in the sorted list;
- and
- inserting the node to be added into the sorted list at the identified sorted position.
Dependencies are inferred from the claim text.