会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 45. 发明申请
    • INCREMENTAL CLUSTERING OF INDEXED XML DATA
    • 索引XML数据的增量聚类
    • WO2009153793A1
    • 2009-12-23
    • PCT/IL2009/000609
    • 2009-06-18
    • TECHNION RESEARCH & DEVELOPMENT FOUNDATION LTD.SHMUELI, OdedSHNAIDERMAN, Lila
    • SHMUELI, OdedSHNAIDERMAN, Lila
    • G06F17/30
    • G06F17/30923G06F17/30911G06F17/30961
    • In a data storage and retrieval system wherein data is stored and retrieved in pages, said data comprising connected nodes arranged such that each page stores only complete nodes, said connected nodes being connected via a plurality of overlapping tree structures, a method of minimizing page retrieval in the face of changing relationships between nodes comprising: selecting at least two of said overlapping tree structures; incrementally adjusting a page node structure dynamically based on real time workload, separately according to each selected tree structure, to form modified partitions for each tree structure, each modified partition being so as to minimize page faults; for each modified partition calculating a modification gain to indicate which partition has provided a greater minimization of page faults; and selecting the tree structure and modified partition corresponding to the best modification gain.
    • 在其中以页面存储和检索数据的数据存储和检索系统中,所述数据包括被布置为使得每个页面仅存储完整节点的连接节点,所述连接的节点通过多个重叠的树结构连接,一种使页面检索最小化的方法 面对改变节点之间的关系,包括:选择所述重叠树结构中的至少两个; 根据每个选择的树结构,分别根据实时工作量动态地调整页面节点结构,以形成每个树结构的修改的分区,每个修改的分区是最小化页面错误; 对于每个修改的分区计算修改增益以指示哪个分区提供了更大的页面错误最小化; 并选择对应于最佳修改增益的树结构和修改分区。