知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

95 records (took 0.022 seconds)

    TECHNIQUE OF COMPREHENSIVELY SUPPORT AUTONOMOUS JSON DOCUMENT OBJECT (AJD) CLOUD SERVICE
    11.
    发明申请
    TECHNIQUE OF COMPREHENSIVELY SUPPORT AUTONOMOUS JSON DOCUMENT OBJECT (AJD) CLOUD SERVICE 审中-公开

    公开(公告)号：US20200210398A1

    公开(公告)日：2020-07-02

    申请号：US16690817

    申请日：2019-11-21

    Applicant: Oracle International Corporation

    Inventor： Zhen Hua Liu ,  Vikas Arora ,  Ying Lu ,  Sriram Krishnamurthy ,  Hui Joe Chang ,  Beda Christoph Hammerschmidt ,  Joshua Jeffrey Spiegel

    IPC: G06F16/22 ,  G06F16/2455 ,  G06F16/28

    Abstract: The present invention relates to autonomous tuning of a data grid of documents in a database. Herein are techniques for storage cells to autonomously maintain local indices and other optimization metadata and algorithms to accelerate selective access into a distributed collection of documents. In an embodiment, each storage cell persists a respective subset of documents. Each storage cell stores, in memory, respective index(s) that map each item to location(s), in one or more documents of the respective subset of documents, where the item occurs. One or more computers execute, based on at least a subset of the indices of the storage cells, a data access request from a database management system. In an embodiment, a cloud of JSON document services provides an easy-to-use, fully autonomous JSON document database that horizontally and elastically scales to deliver fast execution of document transactions and queries without needing tuning by a database administrator.

    Leveraging structured XML index data for evaluating database queries
    12.
    发明授权
    Leveraging structured XML index data for evaluating database queries 有权

    公开(公告)号：US10262076B2

    公开(公告)日：2019-04-16

    申请号：US14513176

    申请日：2014-10-13

    Applicant: Oracle International Corporation

    Inventor： Hui Joe Chang ,  Thomas Baby ,  Zhen Hua Liu

    IPC: G06F17/30

    Abstract: A query may be rewritten to leverage information stored in a structured XML index. An operator in the query may be analyzed to determine an input source database object for the operator by traversing an operator tree rooted at the operator. The path expressions associated with the operator tree may be fused together to form an effective path expression for the operator. If the effective path expression directly matches a path expression derived from the index, the query may be rewritten using references to the index. Operators in a query that have effective paths that refer to data in the same index table may be grouped together. A single subquery may be written for a group of operators. Also, a structured XML index may be used as an implied schema for indexed XML data. This implied schema may be used to optimize queries that refer to the indexed XML data.

    Generic Indexing for Efficiently Supporting Ad-Hoc Query Over Hierarchically Marked-Up Data
    14.
    发明申请
    Generic Indexing for Efficiently Supporting Ad-Hoc Query Over Hierarchically Marked-Up Data 有权
    通过索引有效地支持分层标记数据的查询

    公开(公告)号：US20150134670A1

    公开(公告)日：2015-05-14

    申请号：US14498893

    申请日：2014-09-26

    Applicant: Oracle International Corporation

    Inventor： Zhen Hua Liu ,  Beda Hammerschmidt ,  Douglas McMahon

    IPC: G06F17/30

    CPC classification number: G06F17/30327 ,  G06F17/30286

    Abstract: Hierarchical data objects are indexed using an index referred to herein as a hierarchy-value index. A hierarchy-value index has, as index keys, tokens (tag name, a word in node string value) that are extracted from hierarchical data objects. Each token is mapped to the locations that correspond to the data for the token in hierarchical data objects. A token can represent a non-leaf node, such as an XML element or a JSON field. A location can be a region covering and subsuming child nodes. For a token that represents a non-leaf node, a location to which the token is mapped contains the location of any token corresponding to a descendant node of the non-leaf node. Thus, token containment based on the locations of tokens within a hierarchical data object may be used to determine containment relationships between nodes in a hierarchical data object.

    Abstract translation: 使用本文中称为层次值索引的索引对分层数据对象进行索引。 层次值索引具有从分层数据对象中提取的令牌（标记名称，节点字符串值中的字）的索引关键字。 每个令牌映射到与分层数据对象中令牌的数据相对应的位置。 令牌可以表示非叶节点，例如XML元素或JSON字段。 位置可以是覆盖和包含子节点的区域。 对于表示非叶节点的令牌，令牌映射的位置包含与非叶节点的后代节点对应的任何令牌的位置。 因此，可以使用基于分级数据对象内的令牌的位置的令牌容纳来确定分层数据对象中的节点之间的包含关系。

    KNOWLEDGE INTENSIVE DATA MANAGEMENT SYSTEM FOR BUSINESS PROCESS AND CASE MANAGEMENT
    15.
    发明申请
    KNOWLEDGE INTENSIVE DATA MANAGEMENT SYSTEM FOR BUSINESS PROCESS AND CASE MANAGEMENT 有权
    了解企业流程和案例管理的强化数据管理系统

    公开(公告)号：US20140310285A1

    公开(公告)日：2014-10-16

    申请号：US14109651

    申请日：2013-12-17

    Applicant: Oracle International Corporation

    Inventor： Eric S. Chan ,  Dieter Gawlick ,  Adel Ghoneimy ,  Zhen Hua Liu

    IPC: G06F17/30

    CPC classification number: H04L41/5009 ,  G06F9/4881 ,  G06F11/008 ,  G06F11/0715 ,  G06F11/0718 ,  G06F11/0751 ,  G06F11/0778 ,  G06F11/079 ,  G06F11/3003 ,  G06F11/3037 ,  G06F11/34 ,  G06F11/3409 ,  G06F11/3419 ,  G06F11/3452 ,  G06F11/3471 ,  G06F17/30289 ,  G06F17/30598 ,  G06F2201/865 ,  G06F2201/88

    Abstract: Data can be categorized into facts, information, hypothesis, and directives. Activities that generate certain categories of data based on other categories of data through the application of knowledge which can be categorized into classifications, assessments, resolutions, and enactments. Activities can be driven by a Classification-Assessment-Resolution-Enactment (CARE) control engine. The CARE control and these categorizations can be used to enhance a multitude of systems, for example diagnostic system, such as through historical record keeping, machine learning, and automation. Such a diagnostic system can include a system that forecasts computing system failures based on the application of knowledge to system vital signs such as thread or stack segment intensity and memory heap usage. These vital signs are facts that can be classified to produce information such as memory leaks, convoy effects, or other problems. Classification can involve the automatic generation of classes, states, observations, predictions, norms, objectives, and the processing of sample intervals having irregular durations.

    Abstract translation: 数据可以分为事实，信息，假设和指令。 通过应用可分类到分类，评估，决议和制定的知识，基于其他类别的数据生成某些类别的数据的活动。 活动可以通过分类评估 - 分配制度（CARE）控制引擎来驱动。 CARE控制和这些分类可用于增强大量系统，例如诊断系统，例如通过历史记录保存，机器学习和自动化。 这样的诊断系统可以包括基于将知识应用于诸如线程或堆栈段强度和内存堆使用的系统生命体征来预测计算系统故障的系统。 这些生命体征是可以分类以产生诸如记忆泄漏，车队效应或其他问题的信息的事实。 分类可以涉及自动生成类，状态，观察，预测，规范，目标以及具有不规则持续时间的采样间隔的处理。

    Framework and method for consistent cross-tier data validation
    18.
    发明授权
    Framework and method for consistent cross-tier data validation 有权

    公开(公告)号：US12147398B2

    公开(公告)日：2024-11-19

    申请号：US18115629

    申请日：2023-02-28

    Applicant: Oracle International Corporation

    Inventor： Tirthankar Lahiri ,  Srikrishnan Suresh ,  Beda Christoph Hammerschmidt ,  Adrian Daniel Popescu ,  Jesse Kamp ,  Zhen Hua Liu

    IPC: G06F16/00 ,  G06F16/21 ,  G06F16/23 ,  G06F16/25

    Abstract: A computer analyzes a relational schema of a database to generate a data entry schema and encodes the data entry schema as JSON. The data entry schema is sent to a database client so that the client can validate entered data before the entered data is sent for storage. From the client, entered data is received that conforms to the data entry schema because the client used the data entry schema to validate the entered data before sending the data. Into the database, the entered data is stored that conforms to the data entry schema. The data entry schema and the relational schema have corresponding constraints on a datum to be stored, such as a range limit for a database column or an express set of distinct valid values. A constraint may specify a format mask or regular expression that values in the column should conform to, or a correlation between values of multiple columns.

    UBIQUITOUS SEARCH ON DATA STORED IN THE RDBMS
    19.
    发明申请
    UBIQUITOUS SEARCH ON DATA STORED IN THE RDBMS 有权

    公开(公告)号：US20240378199A1

    公开(公告)日：2024-11-14

    申请号：US18367722

    申请日：2023-09-13

    Applicant: Oracle International Corporation

    Inventor： Saurabh Naresh Netravalkar ,  Aleksandra Czarlinska ,  Zhen Hua Liu ,  Beda Christoph Hammerschmidt

    IPC: G06F16/2453

    Abstract: Techniques are provided for creating a “ubiquitous search index” which allows for full-text as well as value range-based search across all columns from multiple database tables, multiple user-defined unmaterialized views, and external sources. In one implementation, the data is indexed in a peculiarly constructed schema-based JSON format without duplicating data. The techniques maintain eventual consistency with the normalized source of truth database tables, and do not have a significant impact on the performance of transactional Data Manipulation Language (DML) operations.

Patent Agency Ranking