会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Adding and subtracting KStores
    • 添加和减去KStores
    • US08010569B2
    • 2011-08-30
    • US12319030
    • 2008-12-31
    • Jane C. Mazzagatti
    • Jane C. Mazzagatti
    • G06F7/00G06F17/00
    • G06F17/30327
    • The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore.
    • KStore是由一个或多个相互关联,非常非常规的树木组成的数据库。 可以将一个KStore添加到现有KStore中,以通过遍历KStores的树并增加计数字段来创建更新的KStore,以反映添加的类似节点的计数。 根据需要添加新的KStore结构。 可以从现有的KStore中减去KStore,通过遍历树KSs和减少更新的KStore中的计数字段来创建更新的KStore,以反映类似节点的减去的计数。 KStore结构根据需要被移除。 可以通过隔离用于更新的路径,从另一个KStore添加或减去KStore的部分。 可以从KStore重新创建个别记录的数据集,而不是递增或递减计数。
    • 7. 发明申请
    • Adding and subtracting kstores
    • 添加和减去kstore
    • US20100169372A1
    • 2010-07-01
    • US12319030
    • 2008-12-31
    • Jane C. Mazzagatti
    • Jane C. Mazzagatti
    • G06F17/30G06F7/00
    • G06F17/30327
    • The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore.
    • KStore是由一个或多个相互关联,非常非常规的树木组成的数据库。 可以将一个KStore添加到现有KStore中,以通过遍历KStores的树并增加计数字段来创建更新的KStore,以反映添加的类似节点的计数。 根据需要添加新的KStore结构。 可以从现有的KStore中减去KStore,通过遍历树KSs和减少更新的KStore中的计数字段来创建更新的KStore,以反映类似节点的减去的计数。 KStore结构根据需要被移除。 可以通过隔离用于更新的路径,从另一个KStore添加或减去KStore的部分。 可以从KStore重新创建个别记录的数据集,而不是递增或递减计数。
    • 8. 发明申请
    • Types of nodes in a kstore
    • kstore中的节点类型
    • US20100169371A1
    • 2010-07-01
    • US12319029
    • 2008-12-31
    • Jane C. Mazzagatti
    • Jane C. Mazzagatti
    • G06F17/30G06F7/00
    • G06F16/2246
    • The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Nodes in a KStore are typically comprised of at least four fields, including a pointer to an asCase node, a pointer to an asResult node, a pointer to an asCaseList and a pointer to an asResultList. Because either an asCaseList or an asResultList but not both will exist in any particular node, two new node types are created, one node comprising a node with an asCase pointer, an asResult pointer and asCaseList pointer but not including a pointer to an asResultList and one node with a pointer to an asCase node, and asResult node and an asResultList but not including a pointer to an asCaseList. Alternatively, a single node structure may exist with a pointer to a list in one field and an indicator stored in another field that indicates directly or indirectly whether the list pointed to is an asCaseList or an asResultList.
    • KStore或K是由一个或多个相互关联的,非常非常规的树木组成的数据库。 KStore中的节点通常包括至少四个字段,包括指向asCase节点的指针,指向asResult节点的指针,指向asCaseList的指针和指向asResultList的指针。 因为任何一个节点都存在一个asCaseList或一个asResultList,而且两个都不存在,所以创建了两个新的节点类型,一个节点包含一个具有asCase指针的节点,一个asResult指针和一个asCaseList指针,但不包括一个指向asResultList的指针 节点具有指向asCase节点的指针,以及asResult节点和asResultList,但不包含指向asCaseList的指针。 或者,单个节点结构可以存在指向一个字段中的列表的指针和存储在另一个字段中的指示符,其指示直接或间接指示的列表是否是asCaseList或asResultList。