专利名称：Database heap management system with
variable page size and fixed instruction setaddress resolution
发明人：David J. Layden,Jeff Beltz,David DeKeyser申请号：US12064549申请日：20060801公开号：US07818346B2公开日：20101019
专利附图：
摘要：A heap management system for a database uses “sets” of pages to storedatabase information. As memory for each successive set of pages is allocated, more
memory is allocated for storing rows in each page of the set. Similarly, the maximumnumber of rows of information storable in each page of each set is greater for eachsuccessive set of pages. The number of computer instructions needed to resolve (orcalculate) the memory address for a particular row is fixed. Given a target row number,(and the number of rows in the first page, and the width of the column or column group),only a fixed number of computer instructions need to be executed to resolve the startingmemory address for the target row. In addition, information of the same type (i.e., one ormore columns of a table) may be stored in different pages, and these pages may belocated in discontiguous memory segments. This allows space for new rows to beallocated, without requiring all pre-existing rows to be moved to a different memorysegment.
申请人：David J. Layden,Jeff Beltz,David DeKeyser
地址：Indianapolis IN US,Indianapolis IN US,Indianapolis IN US
国籍：US,US,US
代理机构：Overhauser & Lindman, LLC
更多信息请下载全文后查看
因篇幅问题不能全部显示，请点此查看更多更全内容