会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Database management system, method and program for supporting the
mutation of a composite object without read/write and write/write
conflicts
    • 数据库管理系统,支持复制对象突变的方法和程序,无需读/写和写/写冲突
    • US5857182A
    • 1999-01-05
    • US786605
    • 1997-01-21
    • Linda Gail DeMichielGene Y. C. FuhMichelle Mei-Chiou JouBruce Gilbert LindsayNelson Mendonca MattosSerge Philippe RielauBrian Thinh-Vinh Tran
    • Linda Gail DeMichielGene Y. C. FuhMichelle Mei-Chiou JouBruce Gilbert LindsayNelson Mendonca MattosSerge Philippe RielauBrian Thinh-Vinh Tran
    • G06F17/30
    • G06F17/30607Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99936Y10S707/99937Y10S707/99938
    • The system, method, and program of this invention avoids potential write/write conflicts and read/write conflicts when a subcomponent of a composite object (e.g., an ADT) is mutated. The embodiments of this invention define a copy semantic for the mutation function. In one embodiment, a copy function is inserted prior to any mutation function. In a another embodiment, a global compile-time analysis is performed to determine if a write/write or read/write conflict exists; and to eliminate redundant copy constructors if a conflict does exist. In a preferred embodiment, only a local analysis is performed during the parsing phase, thereby avoiding a global compile-time analysis. A mutation safe flag is associated with each parse tree node. A read target leaf parse tree node is set to false while non-leaf parse tree nodes (functions) derive their value from an incoming node, except that constructors and copy constructor functions are always true. Whether or not a copy is made of the composite object (i.e., whether or not a copy constructor is inserted) prior to a mutation is determined according to the setting of the mutation safe flags and according to the following. If a mutation safe flag for a mutation function is false, a copy constructor is inserted for the mutated composite object and the mutation safe flag is set to true. In addition, for update and trigger statements, the mutation safe flag for a mutated target is defaulted to true. Furthermore, related update entries are grouped together and a copy is generated for the common target. The generated copy is used as the common target for all of the mutations caused by the update entries grouped together in order to accumulate all of the desired mutations in a same copy of the composite object.
    • 本发明的系统,方法和程序在复合对象(例如,ADT)的子组件被突变时避免潜在的写入/写入冲突和读/写冲突。 本发明的实施例定义了突变功能的复制语义。 在一个实施例中,在任何突变功能之前插入复制功能。 在另一实施例中,执行全局编译时分析以确定是否存在写/写或读/写冲突; 并且如果存在冲突,则消除冗余的拷贝构造函数。 在优选实施例中,在解析阶段仅执行局部分析,从而避免了全局编译时分析。 突变安全标志与每个解析树节点相关联。 读取目标叶解析树节点设置为false,而非叶解析树节点(函数)从传入节点导出其值,除了构造函数和复制构造函数始终为真。 根据突变安全标志的设置,根据以下来确定复制对象(即,是否插入复制构造函数)之前的副本是否被复制。 如果突变功能的突变安全标志为假,则为突变复合对象插入复制构造函数,并将突变安全标志设置为true。 另外,对于更新和触发语句,突变目标的突变安全标志默认为true。 此外,将相关的更新条目分组在一起,并为共同目标生成副本。 生成的拷贝被用作由更新条目组合在一起引起的所有突变的共同目标,以便累积复合对象的相同副本中的所有期望的突变。
    • 7. 发明授权
    • Packing nodes into records to store XML XQuery data model and other hierarchically structured data
    • 将节点包装到记录中以存储XML XQuery数据模型和其他分层结构化数据
    • US08543614B2
    • 2013-09-24
    • US11209997
    • 2005-08-22
    • Yao-Ching Stephen ChenYue HuangFen-Ling LinBrian Thinh-Vinh TranGuogen Zhang
    • Yao-Ching Stephen ChenYue HuangFen-Ling LinBrian Thinh-Vinh TranGuogen Zhang
    • G06F17/30
    • G06F17/30917G06F17/30911
    • A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.
    • 分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。 节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。 当子树存储在单独的记录中时,代理节点用于表示父记录中的子树。 节点标识符索引中的映射反映了子树节点在单独记录中的存储。 由于记录之间的引用是通过逻辑节点标识符,只要索引被更新或重建以维持与所得到的数据页的同步,就不限于跨页面的记录移动。 这种方法具有高度可扩展性,并且比使用节点之间的明确引用的方法具有更小的存储消耗。