公开(公告)号：US10262012B2

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

申请号：US14836680

申请日：2015-08-26

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Beda Hammerschmidt ,  Douglas McMahon

IPC: G06F17/30

Abstract: Techniques related to binary encoding of hierarchical data objects to support efficient path navigation of the hierarchical data objects are disclosed. A hierarchical data object may include field names that are associated with field values. A method may involve generating a plurality of hash codes, each hash code corresponding to a respective field name. The method may involve generating a hash-code mapping that maps each hash code to a respective field-name identifier. The method may involve generating a field-name mapping that maps each field name to a respective field-name identifier. The method may involve generating a hierarchical tree of nodes that includes non-leaf nodes and leaf nodes. A particular non-leaf node may include a child node mapping that maps the particular non-leaf node to one or more child nodes and may include a field-name-identifier-to-child mapping that maps a respective field-name identifier to each of the one or more child nodes.

公开(公告)号：US09659045B2

公开(公告)日：2017-05-23

申请号：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.

公开(公告)号：US20170031975A1

公开(公告)日：2017-02-02

申请号：US15146799

申请日：2016-05-04

Applicant: Oracle International Corporation

Inventor： Aurosish Mishra ,  Shasank K. Chavan ,  Allison L. Holloway ,  Jesse Kamp ,  Ramesh Kumar ,  Zhen Hua Liu ,  Niloy Mukherjee ,  Amit Ganesh ,  Tirthankar Lahiri ,  Vineet Marwah

IPC: G06F17/30

CPC classification number: G06F17/30383 ,  G06F17/30339 ,  G06F17/3046 ,  G06F17/30477

Abstract: Techniques are described for materializing pre-computed results of expressions. In an embodiment, a set of one or more column units are stored in volatile or non-volatile memory. Each column unit corresponds to a column that belongs to an on-disk table within a database managed by a database server instance and includes data items from the corresponding column. A set of one or more virtual column units, and data that associates the set of one or more column units with the set of one or more virtual column units, are also stored in memory. The set of one or more virtual column units includes a particular virtual column unit storing results that are derived by evaluating an expression on at least one column of the on-disk table.

Abstract translation: 描述了用于实现预先计算的表达式结果的技术。 在一个实施例中，一组一个或多个列单元存储在易失性或非易失性存储器中。 每个列单元对应于属于由数据库服务器实例管理的数据库中的磁盘表上的列，并包括来自相应列的数据项。 一组一个或多个虚拟列单元以及将一个或多个列单元的集合与一个或多个虚拟列单元的集合相关联的数据也存储在存储器中。 一个或多个虚拟列单元的集合包括存储通过评估磁盘表的至少一列上的表达而导出的结果的特定虚拟列单元。

公开(公告)号：US09390115B2

公开(公告)日：2016-07-12

申请号：US14052622

申请日：2013-10-11

Applicant: Oracle International Corporation

Inventor： Zhen Hua Liu ,  Dieter Gawlick

IPC: G06F17/30

CPC classification number: G06F17/30315 ,  G06F17/30339 ,  G06F17/30424

Abstract: A method and apparatus queries a table in a database where the table includes at least one column declared to be sparse. A binary large object may be used to store the sparse column data. The object includes a column-id and column-value pair for each non-null value. To answer a query with a constraint on a sparse column, the object is searched for one or more column ids to obtain the column values. Rows whose column values match a constraint are returned. In another embodiment, an internal table is used. Each tuple in the internal table has a column id and a value array indexed by an ordinal row number. To answer a query with a constraint on a sparse column, the column value in the internal table is found and matched against the constraint. If the match is successful, the index of the column value in the internal table is returned.

Abstract translation: 方法和装置查询数据库中的表，其中表包括至少一个声明为稀疏的列。 二进制大对象可用于存储稀疏列数据。 对象包括每个非空值的列-ID和列值对。 要在稀疏列上接受具有约束的查询，将搜索该对象的一个​​或多个列ID以获取列值。 其列值与约束匹配的行将返回。 在另一个实施例中，使用内部工作台。 内部表中的每个元组都有一个列id和一个由序号行编号索引的值数组。 要使用稀疏列上的约束来回答查询，会发现内部表中的列值并与约束匹配。 如果匹配成功，则返回内部表中列值的索引。

公开(公告)号：US09330124B2

公开(公告)日：2016-05-03

申请号：US14044982

申请日：2013-10-03

Applicant: Oracle International Corporation

Inventor： Beda Hammerschmidt ,  Zhen Hua Liu ,  Thomas Baby ,  Kongyi Zhou

IPC: G06F17/30

CPC classification number: G06F17/30312 ,  G06F17/30595

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities. A request to store data for the entities may be executed by creating relational database structures to store the data.