Storage clustering and packing of objects on the basis of query workload ranking
US5504887A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Sep 10, 1993 |
| Grant date | Apr 2, 1996 |
| Priority date | — |
| Expiry date | Sep 10, 2013 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99956
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An apparatus and method is disclosed for efficiently clustering program objects on a unit of storage in a secondary memory, e.g., a page of memory on a disc. The objects are clustered so that a set of queries (query set) can access the stored objects with a minimum number of page transfers from secondary storage to main memory. To determine how the objects are clustered together on each memory page, queries in the query set and the objects that they access are identified. The queries are ranked by a number of factors including the query weight, the memory space required to store objects accessed by a query, and the number of objects a query has in common with other queries. The objects accessed by the query set are clustered on secondary memory pages according to the query ranking. Partially packed memory pages can be combined to minimize the cost of the query set accessing the stored objects.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.