Memory efficient representation of relational data with constant time random access to the data itself
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 26, 2014
Grant Date -
Mar 5, 2009
app pub date -
Sep 5, 2008
filing date -
Sep 5, 2007
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
An efficient method for storing relational data in a memory space uses B tree and B+ tree structures to store data for a database where non-identical values are stored in a string buffer and pointers to the string buffer are stored in a table buffer, and where identical data is stored only once, and each instance of that value in the database is referenced by a pointer to such identical data corresponding to the locations in the database where that identical value exists, thereby preserving physical memory and increasing the storage capacity of a fixed memory space.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully