Random access memory and corresponding method for managing a random access memory
US-2024404613-A1 · Dec 5, 2024 · US
Memory compaction mechanism for main memory databases
US9053003B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9053003-B2 |
| Application number | US-201213529865-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 21, 2012 |
| Priority date | Jun 21, 2012 |
| Publication date | Jun 9, 2015 |
| Grant date | Jun 9, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
The present invention extends to methods, systems, and computer program products for performing memory compaction in a main memory database. The main memory database stores records within pages which are organized in doubly linked lists within partition heaps. The memory compaction process uses quasi-updates to move records from a page to the emptied to an active page in a partition heap. The quasi-updates create a new version of the record in the active page, the new version having the same data contents as the old version of the record. The creation of the new version can be performed using a transaction that employs wait for dependencies to allow the old version of the record to be read while the transaction is creating the new version thereby minimizing the effect of the memory compaction process on other transactions in the main memory database.
First claim
Opening claim text (preview).
What is claimed: 1. A method, performed by a computer system storing a main memory database, for performing memory compaction within the main memory database, the method comprising: scanning a doubly linked list of pages in memory, the pages for storing records of the main memory database, scanning comprising determining memory utilization of each page; determining, based on the memory utilization of each page, which pages have a memory utilization that is below a specified thre…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06F12/023Primary
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9053003B2 cover?
- The present invention extends to methods, systems, and computer program products for performing memory compaction in a main memory database. The main memory database stores records within pages which are organized in doubly linked lists within partition heaps. The memory compaction process uses quasi-updates to move records from a page to the emptied to an active page in a partition heap. The q…
- Who is the assignee on this patent?
- Tsirogiannis Dimitrios, Larson Per-Ake, Microsoft Technology Licensing Llc
- What technology area does this patent fall under?
- Primary CPC classification G06F12/023. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Jun 09 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).