Extend CRUD to support lifecycle management and business continuity
    1.
    发明公开
    Extend CRUD to support lifecycle management and business continuity 审中-公开
    先进的CRUD功能来支持生命周期管理和业务连续性

    公开(公告)号:EP2194467A1

    公开(公告)日:2010-06-09

    申请号:EP09008623.2

    申请日:2009-07-01

    申请人: SAP AG

    发明人: Driesen, Volker

    IPC分类号: G06F17/30

    摘要: The subject matter disclosed herein provides methods and apparatus, including computer program products, for providing software updates. In one aspect there is provided a method. The method may include receiving a command for execution at a database. Moreover, a determination may be made as to whether the received command is one of a set of extended commands. The set of extended commands includes lock read, lock write, migrate, copy, and log changes. The received command is executed at the database. Related systems, apparatus, methods, and/or articles are also described

    摘要翻译: 在游离缺失的主题盘提供了方法和设备,包括计算机程序产品,用于提供软件更新。 在一个方面,提供了一种方法。 该方法可以包括在一个数据库接收用于执行的指令。 更完了,可确定作出关于是否接收的命令是一组扩展命令中的一个。 该组扩展命令包括锁定读,写锁定,迁移,复制和记录改变。 接收到的命令是在数据库中执行。 相关的系统,即,装置,方法,和/或文章中描述

    VERFAHREN ZUR STEUERUNG EINES RELATIONALEN DATENBANKSYSTEMS
    2.
    发明公开
    VERFAHREN ZUR STEUERUNG EINES RELATIONALEN DATENBANKSYSTEMS 有权
    一种用于控制关系型数据库系统

    公开(公告)号:EP1941395A1

    公开(公告)日:2008-07-09

    申请号:EP05799132.5

    申请日:2005-10-28

    发明人: MÖSTL, Matthias

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30418 G06F17/30421

    摘要: The invention relates to a method for controlling a relational database system by executing, using a database language, a database inquiry in a relational database which comprises as the assigned data structure a plurality of data tables interlinked by relations, a table of said relations being available. A processable database instruction without relation-specific operations is established by indicating those data tables to which the processing functions should be applied and also indicating the order of the selected data tables which should be used for processing. An access path is determined which concretely specifies an access order to the database. For this purpose, a partial access path is calculated using the table of relations between two successive, selected data tables based on the relations existing between the two successive data tables. The access path is then put together from all the calculated partial access paths.

    Data linking system and method using tokens
    4.
    发明公开
    Data linking system and method using tokens 审中-公开
    Vorrichtung und Verfahren zur Verbindung von Daten unter Verwendung von Token

    公开(公告)号:EP1118948A2

    公开(公告)日:2001-07-25

    申请号:EP00311258.8

    申请日:2000-12-15

    IPC分类号: G06F17/30

    摘要: In a method for linking data using permanent tokens (10), the tokens may be used to link data pertaining to a customer, a business, an address, an occupancy, or a household. The tokens are created in a central repository (24), which maintains an identification class (30) for each entity. The identification class contains all available information concerning the entity. The tokens may be applied to a data storage system to allow real-time construction of a total customer view. The tokens may also be used to link the data storage system to a repository, such that the total customer view contains all available information concerning the customer. The total customer view may be used to formulate a response to customer input, such as a purchase or access to an Internet web page maintained by the data owner. By matching tokens instead of names and addresses, potential ambiguities and erroneous duplicates are eliminated. Data updates may be performed incrementally, and may be pushed from the repository to the data owner as new information is received.

    摘要翻译: 在使用永久令牌(10)链接数据的方法中,令牌可以用于链接与客户,商家,地址,占用或家庭有关的数据。 标记在中央存储库(24)中创建,其维护每个实体的标识类(30)。 识别类包含有关实体的所有可用信息。 令牌可以应用于数据存储系统以允许实时地构建总客户视图。 令牌还可用于将数据存储系统链接到存储库,使得总客户视图包含关于客户的所有可用信息。 总客户视图可用于制定对客户输入的响应,例如购买或访问由数据所有者维护的因特网网页。 通过匹配令牌而不是名称和地址,消除了潜在的模糊性和错误的重复。 可以递增地执行数据更新,并且可以在接收到新信息时从存储库推送到数据所有者。

    DISTRIBUTED SQL QUERY PROCESSING USING KEY-VALUE STORAGE SYSTEM
    5.
    发明公开
    DISTRIBUTED SQL QUERY PROCESSING USING KEY-VALUE STORAGE SYSTEM 审中-公开
    VERTEILTE SQL-ANFRAGENVERARBEITUNG MIT EINEMSCHLÜSSELWERT-SPEICHERSYSTEM

    公开(公告)号:EP2932410A2

    公开(公告)日:2015-10-21

    申请号:EP13818089.8

    申请日:2013-12-13

    IPC分类号: G06F17/30

    摘要: Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices.

    摘要翻译: 分布式存储系统支持SQL,同时通过使用分层在事务键值系统(存储组件)之上的SQL库(SQL执行组件)来提供可扩展性和容错性。 SQL库包括在客户机上运行的解析器和执行引擎,而存储组件包括用于存储数据的键值系统。 SQL库解析从客户端应用程序接收的SQL查询,并将其映射到键值系统上的事务。 密钥值系统存储由密钥标识的数据项,并提供并发控制机制来处理并发事务。 键值系统可以是具有多个存储服务器的分布式系统,每个存储服务器连接到一个或多个存储设备。

    BROWSER ORIENTED METHOD TO VIEW CONTENTS OF A PLURALITY OF DATABASES
    8.
    发明公开
    BROWSER ORIENTED METHOD TO VIEW CONTENTS OF A PLURALITY OF DATABASES 审中-公开
    基于浏览器的方法显示多个数据库的内容

    公开(公告)号:EP1407382A2

    公开(公告)日:2004-04-14

    申请号:EP01935091.7

    申请日:2001-05-04

    IPC分类号: G06F17/30

    摘要: A machine-executed method and apparatus for displaying relationships between records in one or more databases in a browseable format is disclosed. Each database comprises one or more tables. Each table includes one or more fields and one or more records. The method entails: (a) displaying, on a display, a field value of a selected record in a table of a selected database; (b) displaying on the display a list of possible relationships between the selected record and other records in the database, where each possible relationship defines a pathway from the selected record to a list of other records; (c) receiving a user input signal designating one of the possible relationships as a selected relationship; (d) adding to the display at least a portion of a list of records that are related to the selected record through the selected relationship, referred to as the related-records list; and (e) adding to the display a list of possible relationships between the related-records list and other records in the database, where each possible relationship defines a pathway from the related-records list to a list of other records.

    METHOD AND SYSTEM FOR ACCESSING DATA
    9.
    发明授权
    METHOD AND SYSTEM FOR ACCESSING DATA 失效
    方法和系统访问数据

    公开(公告)号:EP0807290B1

    公开(公告)日:2000-05-03

    申请号:EP95936839.0

    申请日:1995-11-06

    IPC分类号: G06F17/30

    摘要: A method and a system for accessing data in a computer-based data processing system. The method comprises the steps of initiating and maintaining data access nodes in a variable access structure. Each access node is provided with references to other access nodes and/or to data items representing an object, each data item carrying only the amount of information which is relevant for its purpose. The data items or the references are provided with a time parameter thus enabling version control and the possibility to handle static or slowly changing data and frequently changed and updated data in a conform manner. The access nodes comprises access control parameters for access control from safety point of view as well as for enabling different views of the access structure and underlying data and objects.

    A SYSTEM AND A METHOD FOR DETERMINING AN INDEX OF AN OBJECT IN A SEQUENCE OF OBJECTS
    10.
    发明公开
    A SYSTEM AND A METHOD FOR DETERMINING AN INDEX OF AN OBJECT IN A SEQUENCE OF OBJECTS 审中-公开
    系统和方法用于确定对象的索引中的对象的序列

    公开(公告)号:EP3151132A1

    公开(公告)日:2017-04-05

    申请号:EP15187685.1

    申请日:2015-09-30

    发明人: Hrebien, Maciej

    IPC分类号: G06F17/30

    摘要: A computer-implemented method for determining an index of an object in a sequence of objects, the method comprising the steps of: obtaining (110) a unique identifier value of a given object O; obtaining (111) a query definition Q of a sequence, the Q query including an order definition according to a parameter of the O object; constructing (112) a Q' query based on the Q query, the Q' query being different from the Q query by having a reversed ordering of results, with respect to the Q query, and providing results having said parameter value of objects preceding or matching the parameter value of the object O in the sequence of objects in the Q query result set; executing (113) the Q' query by a query execution engine; checking (114) whether the object O is matched exactly with the first item in Q' result set and in case it is not matched, requesting (115) one object at position P and one object at position P + 1, the position P being the position of an object from Q result set corresponding to the first item of Q' result set; and in case the Q' result set is empty, choosing (116a) an object at the first position in Q result set as the closest one to the object O; in case only one of the requested objects is available, choosing (116b) the object at the last position of Q result set as the closest one to the object O; in case both objects at position P and position P + 1 are available, determining which of these objects is closer with respect to the object O and choosing (116c) this object as the closest object; and determining (117) the index of the selected closest object in Q sequence as the index of the closest object to the O object.

    摘要翻译: 对于在对象中的一个序列中的对象的索引的确定性采矿的计算机实现的方法,所述方法包括以下步骤:获取(110)一个给定的对象O的唯一标识符值; 获得(111)的Q-序列的查询定义,查询Q包括命令定义根据对象O的参数; 构建(112)一个Q“基于Q的查询的查询中,Q”查询由具有结果的反转顺序,相对于到Q查询,并提供结果作为来自Q查询不同具有所述的参数值的对象preceding-或 在Q QueryResult中一组对象的序列中的对象O的参数值匹配; 执行(113)的Q“的查询由查询执行引擎; 检查(114)是否将对象O被精确地与所述第一项目中Q“结果组匹配并且如果它不匹配,请求在位置P(115)一个对象和在位置P + 1中,位置P是一个对象 自Q结果设置对应于Q“的结果集的所述第一项的对象的位置; 并且在该情况下,Q“结果集为空,选择(116A)中的Q中的结果所述第一位置设置为最接近的一个到对象O到对象; 在情况下,只有被请求的对象中的一个是可用的,选择(116B)的对象以Q结果的最后的位置设置为最接近的一个到对象O; 在情况下,在位置P和P + 1的位置这两个对象是可用的,确定性的采矿哪这些对象中的更靠近相对于所述物体O,并选择(116℃)的thisObject是最接近的对象; 和确定性开采(117)在最近的Q序列作为最近的对象向O对象的索引所选择的对象的索引。