会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Storage clustering and packing of objects on the basis of query workload
ranking
    • 在查询工作量排序的基础上对对象的存储集群和打包
    • US5504887A
    • 1996-04-02
    • US120102
    • 1993-09-10
    • Ashok MalhotraKenneth J. Perry
    • Ashok MalhotraKenneth J. Perry
    • G06F17/30
    • G06F17/3046G06F17/30705Y10S707/99956
    • 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.
    • 公开了一种用于在次要存储器(例如盘上的存储器页)上的存储单元上有效地聚类程序对象的装置和方法。 这些对象是聚类的,因此一组查询(查询集)可以使用从辅助存储器到主内存的最少页面传输访问存储的对象。 要确定对象在每个内存页面上如何聚类在一起,查询集中的查询和访问对象都会被识别。 这些查询由多个因素排列,包括查询权重,存储查询所访问对象所需的内存空间以及查询与其他查询相同的对象数。 查询集所访问的对象根据查询排名聚类在辅助内存页面上。 可以组合部分打包的内存页面以最小化访问存储对象的查询集的成本。