会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • FULL-FIDELITY REPRESENTATION OF XML-REPRESENTED OBJECTS
    • XML表示对象的全面陈述
    • US20110314043A1
    • 2011-12-22
    • US12817372
    • 2010-06-17
    • Philip A. BernsteinSergey MelnikJames F. TerwilligerIon Vasillian
    • Philip A. BernsteinSergey MelnikJames F. TerwilligerIon Vasillian
    • G06F17/00G06F17/30
    • G06F16/84
    • A data structure may exist in various representations, such as an object in an object-oriented system or a set of elements included in an extensible markup language (XML) document structured according to an XML type defined in an XML schema. While many aspects of these representations may correspond, some aspects of an XML document may not be specified by the XML schema (such as developer comments, whitespace, and preprocessor directives), and may be lost while translating an XML representation of the data structure to an object. These non-schematized aspects may be included in the object as a delta, specifying the location of an aspect with relation to an element defined by the XML schema. Preserving non-schematized aspects may promote the full representation of the data structure as an object, and may facilitate a full-fidelity regeneration of the XML document from which the object was generated.
    • 数据结构可以存在于各种表示中,例如面向对象系统中的对象或根据在XML模式中定义的XML类型而构造的可扩展标记语言(XML)文档中的一组元素。 虽然这些表示的许多方面可能对应,XML文档的某些方面可能不被XML模式(例如开发人员注释,空白和预处理指令)指定,并且可能在将数据结构的XML表示转换为 一个东西。 这些未示意的方面可以作为增量包含在对象中,指定与由XML模式定义的元素相关的方面的位置。 保留非示意性方面可以促进数据结构作为对象的完全表示,并且可以促进对象被生成的XML文档的完全保真再生。
    • 4. 发明申请
    • Automating Evolution of Schemas and Mappings
    • 自动演进模式和映射
    • US20110307501A1
    • 2011-12-15
    • US12815417
    • 2010-06-15
    • James F. TerwilligerPhilip A. BernsteinAditya Unnithan
    • James F. TerwilligerPhilip A. BernsteinAditya Unnithan
    • G06F17/30
    • G06F17/30297
    • Aspects of the subject matter described herein relate to automating evolution of schemas and mappings. In aspects, mappings between a conceptual model and a store model are updated automatically in response to a change that occurs to the conceptual model. For example, when a change occurs to the conceptual model, a local scope of the change is determined. The local scope indicates mappings that are most similar to the type(s) affected by the change. Based on the local scope, a pattern of mappings between the conceptual model and the store model is determined. Using this pattern and the nature of the change, the mappings are updated according to the pattern. In addition, the store model and data thereon may be updated in a manner to preserve existing data that is not to be deleted in response to the change.
    • 本文描述的主题的方面涉及自动演进模式和映射。 在方面中,概念模型和商店模型之间的映射将自动更新,以响应概念模型发生的更改。 例如,当概念模型发生变化时,确定变更的局部范围。 本地范围表示与受更改影响的类型最相似的映射。 基于本地范围,确定概念模型和商店模型之间的映射模式。 使用这种模式和变化的性质,映射根据模式进行更新。 此外,存储模型及其上的数据可以以保存对应于该变化不被删除的现有数据的方式进行更新。
    • 6. 发明授权
    • Mapping composition using algebraic operators
    • 使用代数运算符绘制组合
    • US07539663B2
    • 2009-05-26
    • US11599744
    • 2006-11-15
    • Philip A. BernsteinTodd J. GreenSergey MelnikAlan Nash
    • Philip A. BernsteinTodd J. GreenSergey MelnikAlan Nash
    • G06F7/00G06F17/30
    • G06F17/30569Y10S707/99932Y10S707/99933
    • A general-purpose reusable algebraic-based composition algorithm for composing mappings between data schemas. The algorithm handles more expressive mappings, makes a best-effort to eliminate symbols when a perfect answer cannot be obtained, includes new heuristics, and is extensible. A relational algebraic language is provided wherein each mapping is expressed as a set of constraints, and each constraint is either a containment or equality of two or more relational algebraic expressions. The composition mechanism exploits monotonicity properties of algebraic operators in operator arguments, handles NULLs and bag semantics, operates to allow composition to produce a partial result when a complete result is not possible, facilitates symbols elimination one symbol at a time using left composition, for example, as a way of isolating the symbols, supports making a best-effort to eliminate as many symbols as possible from an intermediate schema, and handles unknown or partially known operators via delayed handling.
    • 一种用于组合数据模式之间映射的通用可重用代数组合算法。 该算法处理更具表现力的映射,尽最大努力在无法获得完美答案时消除符号,包括新的启发式,并且是可扩展的。 提供了关系代数语言,其中每个映射被表示为一组约束,并且每个约束是两个或多个关系代数表达式的容纳或相等。 组合机制利用代数运算符在运算符参数中的单调性,处理NULL和包语义,运算以允许组合在不完整结果时产生部分结果,便于使用左组合一次使用符号消除一个符号 作为隔离符号的方法,支持尽最大努力从中间模式消除尽可能多的符号,并通过延迟处理来处理未知或部分已知的运算符。
    • 9. 发明授权
    • Sliding-window multi-class striping
    • 滑动窗口多级条带
    • US08799572B2
    • 2014-08-05
    • US12426783
    • 2009-04-20
    • Colin ReidPhilip A. Bernstein
    • Colin ReidPhilip A. Bernstein
    • G06F12/16
    • G06F3/0604G06F3/0613G06F3/0631G06F3/0635G06F3/065G06F3/067G06F3/0683G06F3/0689
    • A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.
    • 数据存储器的一系列存储设备可以包括用于存储不同长度和不同类型的数据条带的一个或多个条带。 每个数据条带可以存储在条带集的前缀或其他部分中。 每个数据条带可以由标识每个包含的存储设备上的数据条带的每个页面的地址阵列来标识。 当条纹图案的第一存储设备变满时,可以通过从条带集中移除完整的存储设备来移位条带,并将数据存储的下一个存储设备添加到条带集。 类变量可以与条纹集的存储设备相关联,以标识条纹集可以存储的数据类型。 当计算机将条目集中的不同类的数据存储时,类变量可以增加(或以其他方式修改)。