Memory efficient representation of relational data with constant time random access to the data itself
US8819089B2 · kind B2 · utility
0Cited by
5References
9Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 5, 2008 |
| Grant date | Aug 26, 2014 |
| Priority date | — |
| Expiry date | Jul 5, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/284
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.