-
公开(公告)号：US07526503B2
公开(公告)日：2009-04-28
申请号：US11204338
申请日：2005-08-15
IPC分类号： G06F17/00
CPC分类号： G06F17/30587 , Y10S707/99932 , Y10S707/99944 , Y10S707/99945
摘要： A system and method facilitating data access operations is provided. The system can facilitate an executable, instance-level interaction between a source model (e.g., schema) expressed in a first metamodel (e.g., object-oriented metamodel) and a target model expressed in a second metamodel (e.g., SQL metamodel). The system can produce instance mappings to round-trip the data between the source schema and the generated target schema. Further, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.
摘要翻译： 提供了一种便于数据访问操作的系统和方法。 该系统可以促进在第一元模型（例如，面向对象的元模型）中表达的源模型（例如，模式）和在第二元模型（例如，SQL元模型）中表达的目标模型之间的可执行的实例级交互。 系统可以产生实例映射，以便在源模式和生成的目标模式之间进行数据往返。 此外，可以使用抽象组件将对象模型上的数据访问操作转换为SQL查询和更新。
-
公开(公告)号：US07647298B2
公开(公告)日：2010-01-12
申请号：US11724991
申请日：2007-03-16
申请人： Atul Adya , Philip A. Bernstein , Sergey Melnik
发明人： Atul Adya , Philip A. Bernstein , Sergey Melnik
CPC分类号： G06F17/30418 , Y10S707/99932
摘要： A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.
摘要翻译： 数据访问架构可以包括映射体系结构，用于将应用程序可能使用的数据映射为持久存储在数据库中的数据。 这种映射架构使用两种类型的“映射视图” - 一种用于翻译查询，另一种用于翻译更新。 提供了一种自动生成来自高级映射规范的查询和更新视图的机制。 可以执行验证以确保映射规范在与映射体系结合使用时允许数据从应用程序“往返”到数据库，而不会丢失数据。
-
公开(公告)号：US20080114785A1
公开(公告)日：2008-05-15
申请号：US11599744
申请日：2006-11-15
申请人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
发明人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
IPC分类号： G06F7/00
CPC分类号： G06F17/30569 , Y10S707/99932 , Y10S707/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和包语义，运算以允许组合在不完整结果时产生部分结果，便于使用左组合一次使用符号消除一个符号 作为隔离符号的方法，支持尽最大努力从中间模式消除尽可能多的符号，并通过延迟处理来处理未知或部分已知的运算符。
-
公开(公告)号：US20110314043A1
公开(公告)日：2011-12-22
申请号：US12817372
申请日：2010-06-17
CPC分类号： 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文档的完全保真再生。
-
公开(公告)号：US07539663B2
公开(公告)日：2009-05-26
申请号：US11599744
申请日：2006-11-15
申请人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
发明人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
CPC分类号： G06F17/30569 , Y10S707/99932 , Y10S707/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和包语义，运算以允许组合在不完整结果时产生部分结果，便于使用左组合一次使用符号消除一个符号 作为隔离符号的方法，支持尽最大努力从中间模式消除尽可能多的符号，并通过延迟处理来处理未知或部分已知的运算符。
-
公开(公告)号：US20070226203A1
公开(公告)日：2007-09-27
申请号：US11724991
申请日：2007-03-16
申请人： Atul Adya , Philip A. Bernstein , Sergey Melnik
发明人： Atul Adya , Philip A. Bernstein , Sergey Melnik
IPC分类号： G06F17/30
CPC分类号： G06F17/30418 , Y10S707/99932
摘要： A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.
摘要翻译： 数据访问架构可以包括映射体系结构，用于将应用程序可能使用的数据映射为数据库中保存的数据。 这种映射架构使用两种类型的“映射视图” - 一种用于翻译查询，另一种用于翻译更新。 提供了一种自动生成来自高级映射规范的查询和更新视图的机制。 可以执行验证以确保映射规范在与映射体系结合使用时允许数据从应用程序“往返”到数据库，而不会丢失数据。
-
公开(公告)号：US09336327B2
公开(公告)日：2016-05-10
申请号：US12147822
申请日：2008-06-27
CPC分类号： G06F17/3043 , G06F17/30477 , G06F17/30569 , G06F17/30914 , G06F17/30917 , G06F17/30938
摘要： Described is programmatic access to persistent XML and relational data from applications based upon explicit mappings between object classes, XML schema types, and relations. The mappings are used in data access, that is, they drive query and update processing. A query may be processed into a query for accessing the XML data and another query for second type for accessing the relational data. Mappings support strongly-typed classes and loosely-typed classes, and may be conditional upon other data, may decouple query and update translation performed at runtime from schema translation used at compile time, and/or may be compiled into transformations that produce objects from XML data and transformations that produce XML data from objects. Mappings may be generated automatically or provided by the developer.
摘要翻译： 描述的是根据对象类，XML模式类型和关系之间的显式映射对应用程序的持久性XML和关系数据进行编程访问。 映射用于数据访问，也就是驱动查询和更新处理。 可以将查询处理成用于访问XML数据的查询和用于访问关系数据的第二类型的另一查询。 映射支持强类型类和松散类，并且可以以其他数据为条件，可以在运行时解析执行的编译时使用的模式转换的查询和更新转换，和/或可以编译成从XML生成对象的转换 从对象生成XML数据的数据和转换。 映射可以自动生成或由开发人员提供。
-
公开(公告)号：US20090150367A1
公开(公告)日：2009-06-11
申请号：US12147822
申请日：2008-06-27
IPC分类号： G06F17/30
CPC分类号： G06F17/3043 , G06F17/30477 , G06F17/30569 , G06F17/30914 , G06F17/30917 , G06F17/30938
摘要： Described is programmatic access to persistent XML and relational data from applications based upon explicit mappings between object classes, XML schema types, and relations. The mappings are used in data access, that is, they drive query and update processing. A query may be processed into a query for accessing the XML data and another query for second type for accessing the relational data. Mappings support strongly-typed classes and loosely-typed classes, and may be conditional upon other data, may decouple query and update translation performed at runtime from schema translation used at compile time, and/or may be compiled into transformations that produce objects from XML data and transformations that produce XML data from objects. Mappings may be generated automatically or provided by the developer.
摘要翻译： 描述的是根据对象类，XML模式类型和关系之间的显式映射对应用程序的持久性XML和关系数据进行编程访问。 映射用于数据访问，也就是驱动查询和更新处理。 可以将查询处理成用于访问XML数据的查询和用于访问关系数据的第二类型的另一查询。 映射支持强类型类和松散类，并且可以以其他数据为条件，可以在运行时解析执行的编译时使用的模式转换的查询和更新转换，和/或可以编译成从XML生成对象的转换 从对象生成XML数据的数据和转换。 映射可以自动生成或由开发人员提供。
-
公开(公告)号：US20110295969A1
公开(公告)日：2011-12-01
申请号：US12786447
申请日：2010-05-25
IPC分类号： G06F15/16
CPC分类号： G06F11/1471 , G06F11/2094 , G06F2201/82
摘要： Computers are provided with a totally ordered, durable shared log. Shared storage is used and can be directly accessed by the computers over a network. Append-log operations are made atomic in the face of failures by committing provisional append ordering information onto a log. The log may comprise multiple flash packages or non-volatile memory devices, referred to as segments, although any shared storage device(s) may be used. Each log record is a multi-page stripe, where each page of a stripe is written to a different segment. Fault-tolerant protocol variants append stripes to the log, such that stripes are totally ordered in the log and each stripe is written atomically.
摘要翻译： 计算机提供了一个完全有序，耐用的共享日志。 共享存储被使用，可以由网络上的计算机直接访问。 通过将临时附加订单信息提交到日志，Append-log操作在面临故障时被做成原子。 尽管可以使用任何共享的存储设备，该日志可以包括被称为段的多个闪存包或非易失性存储设备。 每个日志记录是一个多页条带，其中每个条带的页面被写入不同的段。 容错协议变体将条纹附加到日志，使得条纹在日志中完全排序，每个条带是原子写入的。
-
10.发明授权Consistent cluster operational data in a server cluster using a quorum of replicas 有权服务器集群中使用复制数量的一致的集群操作数据公开(公告)号：US07774469B2
公开(公告)日：2010-08-10
申请号：US11225222
申请日：2005-09-12
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译： 通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。 副本成员维护集群操作数据。 当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。 仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。 仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。 仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。
-
-
-
-
-
-
-
-
-
搜索结果
40 条记录 (耗时 0.033 秒)
