Mechanism for uniform access control in a database system
    81.
    发明授权
    Mechanism for uniform access control in a database system 有权
    数据库系统中统一访问控制的机制

    公开(公告)号:US07051039B1

    公开(公告)日:2006-05-23

    申请号:US10259176

    申请日:2002-09-27

    IPC分类号: G06F7/00 G06F17/00

    摘要: Techniques are provided for facilitating uniform access control to data managed by a database server that can emulate hierarchically organized systems, whether the data is accessed through hierarchical or relational access mechanisms. A database server that can emulate hierarchically organized systems uses separate relational or object-relational database tables to store the content of the resources that belong to a hierarchy (the “content structures”) and information that captures the hierarchy (the “hierarchy structures”). Both types of structures contain access control data that define consistent user access privileges. To determine access privileges for a user requesting access to data in the database, access control information is accessed in the hierarchy structures when the request is made through the hierarchical access mechanism, or accessed in the content structures when the request is made through a relational access mechanism. Access control is consistent between the hierarchical or relational access mechanisms because access through either is governed by user access data that reflects the same privileges.

    摘要翻译: 提供了技术,用于促进对数据库服务器管理的数据的统一访问控制,数据库服务器可以模拟分层组织的系统,无论数据是通过分级或关系访问机制访问的。 可以模拟分级组织的系统的数据库服务器使用单独的关系或对象关系数据库表来存储属于层次结构的资源的内容(“内容结构”)和捕获层次结构的信息(“层次结构”) 。 这两种类型的结构都包含定义一致的用户访问权限的访问控制数据。 为了确定请求访问数据库中的数据的用户的访问权限,当通过分层访问机制进行请求时,在层次结构中访问访问控制信息,或者当通过关系访问进行请求时在内容结构中访问访问控制信息 机制。 访问控制在分级或关系访问机制之间是一致的,因为通过任何一个访问控制的用户访问数据反映相同的权限。

    Method and mechanism for efficient storage and query of XML documents based on paths
    83.
    发明申请
    Method and mechanism for efficient storage and query of XML documents based on paths 有权
    基于路径高效存储和查询XML文档的方法和机制

    公开(公告)号:US20050055355A1

    公开(公告)日:2005-03-10

    申请号:US10763355

    申请日:2004-01-23

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30914

    摘要: A method, mechanism, and computer program product for storing, accessing, and managing XML data is disclosed. The approach supports efficient evaluation of XPath queries and also improves the performance of data/fragment extraction. The approach can be applied to schema-less documents. The approach is applicable to all database systems and other servers which support storing and managing XML content. In addition, the approach can be applied to store, manage, and retrieve other types of unstructured or semi-structured data in a database system.

    摘要翻译: 公开了一种用于存储,访问和管理XML数据的方法,机制和计算机程序产品。 该方法支持对XPath查询的高效评估,并且还提高了数据/片段提取的性能。 该方法可以应用于无模式文档。 该方法适用于支持存储和管理XML内容的所有数据库系统和其他服务器。 此外,该方法可以应用于在数据库系统中存储,管理和检索其他类型的非结构化或半结构化数据。

    In-place evolution of XML schemas
    84.
    发明申请
    In-place evolution of XML schemas 有权
    XML模式的就地演进

    公开(公告)号:US20050050105A1

    公开(公告)日:2005-03-03

    申请号:US10648749

    申请日:2003-08-25

    IPC分类号: G06F12/00 G06F17/30

    CPC分类号: G06F17/30297 G06F17/30908

    摘要: A method and system for the in-place evolution of XML schemas is disclosed. To automatically evolve an existing XML schema, a schema evolver receives both an existing XML schema and an XML document as input. The XML document indicates changes to be made to the existing XML schema. Based on the existing XML schema and the XML document, the schema evolver evolves the existing XML schema into a new XML schema that incorporates the changes indicated in the XML document. According to one aspect, the schema evolver generates one or more SQL statements based on the new XML schema. The SQL statements, when executed by a database server, cause the database server to evolve database structures that were based on the formerly existing XML schema so that the database structures conform to the new XML schema. This is accomplished “in place,” without copying the data in the database structures.

    摘要翻译: 公开了一种用于XML模式的就地演化的方法和系统。 为了自动演进现有的XML模式,模式演进器接收现有的XML模式和XML文档作为输入。 XML文档指示对现有XML模式进行的更改。 基于现有的XML架构和XML文档,架构演进者将现有的XML架构演变为新的XML架构,其中包含XML文档中指示的更改。 根据一个方面,模式演进者基于新的XML模式生成一个或多个SQL语句。 SQL语句在由数据库服务器执行时,会导致数据库服务器发展基于以前存在的XML模式的数据库结构,以便数据库结构符合新的XML模式。 这完成了“到位”,而不复制数据库结构中的数据。

    Efficient loading of data into a relational database
    85.
    发明申请
    Efficient loading of data into a relational database 有权
    将数据高效加载到关系数据库中

    公开(公告)号:US20050050074A1

    公开(公告)日:2005-03-03

    申请号:US10718823

    申请日:2003-11-21

    IPC分类号: G06F17/00

    摘要: Described is a method and system for storing data into a database, where a determination is made if schema metadata that is used to load the data into the database already exists, and where the existing schema metadata is used to load the data into the database if the schema metadata already exists. If the appropriate schema metadata does not exist, then it is generated and cached so that a later load operation for the same schema type will not need to re-generate this information. In this way, the cost to generate the schema metadata is amortized over multiple load operations to load data of the same schema type. The approach is protocol neutral so that multiple different protocol-based loads can operate with the same schema metadata information and load structures.

    摘要翻译: 描述了一种用于将数据存储到数据库中的方法和系统,其中确定用于将数据加载到数据库中的模式元数据是否已经存在,并且使用现有模式元数据将数据加载到数据库中,如果 模式元数据已经存在。 如果相应的模式元数据不存在,那么它将被生成和缓存,以便相同模式类型的后续加载操作将不需要重新生成此信息。 以这种方式,生成架构元数据的成本将通过多个加载操作进行分摊,以加载相同模式类型的数据。 该方法是协议中性的,以便多个不同的基于协议的负载可以使用相同的模式元数据信息和负载结构进行操作。

    Efficient piece-wise updates of binary encoded XML data
    87.
    发明授权
    Efficient piece-wise updates of binary encoded XML data 有权
    二进制编码的XML数据的高效分片更新

    公开(公告)号:US09460064B2

    公开(公告)日:2016-10-04

    申请号:US11437512

    申请日:2006-05-18

    摘要: An XML document can be represented in a compact binary form that maintains all of the features of XML data in a useable form. In response to a request for a modification (e.g., insert, delete or update a node) to an XML document that is stored in the compact binary form, a certain representation of the requested modification is computed for application directly to the binary form of the document. Thus, the requested modification is applied directly to the persistently stored binary form without constructing an object tree or materializing the XML document into a corresponding textual form. Taking into account the nature of the binary form in which the document is encoded, the bytes that actually require change are identified, including identifying where in the binary representation the corresponding actual changes need to be made.

    摘要翻译: XML文档可以以紧凑的二进制形式表示,以可用的形式维护XML数据的所有功能。 响应于以紧凑二进制形式存储的XML文档的修改(例如,插入,删除或更新节点)的请求,对所请求的修改的特定表示被直接计算到二进制形式的 文件。 因此,所请求的修改直接应用于永久存储的二进制形式,而不构造对象树或将XML文档实现为相应的文本形式。 考虑到文档编码的二进制形式的性质,确定实际需要更改的字节,包括识别二进制表示中需要进行相应实际更改的位置。

    Metadata Reuse For Validation Against Decentralized Schemas
    88.
    发明申请
    Metadata Reuse For Validation Against Decentralized Schemas 审中-公开
    元数据重用于分散式模式的验证

    公开(公告)号:US20140075285A1

    公开(公告)日:2014-03-13

    申请号:US13615213

    申请日:2012-09-13

    IPC分类号: G06F17/00

    摘要: A validation procedure employs metadata reuse using composite path signatures to make a metadata reuse determination. The procedure is performed as part of validating a set of data objects. Validating an initial subset of data objects generates N different sets of object-specific metadata, each set of which is associated with a different composite path signature. When subsequently validating another data object, a composite path signature is generated for the data object and compared with the composite path signatures of the N different sets of object-specific metadata. If a match is found, then the object-specific metadata of the matching composite path signature is reused for the data object. The object-specific metadata is remapped to an in-memory representation of the data object.

    摘要翻译: 验证过程使用复合路径签名进行元数据重用以进行元数据重用确定。 该过程作为验证一组数据对象的一部分执行。 验证数据对象的初始子集生成N个不同的对象特定元数据集,每组元素与不同的复合路径签名相关联。 当随后验证另一个数据对象时,为数据对象生成复合路径签名,并与N个不同对象特定元数据集的复合路径签名进行比较。 如果找到一个匹配,则匹配的复合路径签名的特定于对象的元数据被重用于数据对象。 将特定于对象的元数据重新映射到数据对象的内存中表示。

    Mechanism for efficiently searching XML document collections
    89.
    发明授权
    Mechanism for efficiently searching XML document collections 有权
    有效搜索XML文档集合的机制

    公开(公告)号:US08650182B2

    公开(公告)日:2014-02-11

    申请号:US12391818

    申请日:2009-02-24

    申请人: Ravi Murthy

    发明人: Ravi Murthy

    IPC分类号: G06F17/00 G06F17/30

    CPC分类号: G06F17/30569 G06F17/30911

    摘要: The techniques presented herein are directed towards providing a user-directed keyword-based search on a large collection of XML documents, and displaying a summary of results to the user. Prior to receiving search requests from a user, an offline analysis of a large collection of XML documents is performed to construct an inverted index of keywords. For each keyword, the index stores a set of location indicators that identify all the instances of the keyword found in the collection of documents. Once the index is constructed, keyword searching can be done efficiently by a keyword lookup in the index. Various display strategies enable the user to see the specific portion of a large XML document containing the keyword and/or path frequency information allowing the user to easily refine the search to specific paths within the collection of documents.

    摘要翻译: 本文提出的技术旨在提供对大量XML文档集合的用户导向的基于关键字的搜索,并向用户显示结果摘要。 在从用户接收到搜索请求之前,执行大量XML文档的离线分析以构造关键字的反向索引。 对于每个关键字,索引存储一组位置指示符,用于标识在文档集合中找到的关键字的所有实例。 一旦构建了索引,可以通过索引中的关键字查找来高效地进行关键字搜索。 各种显示策略使得用户能够看到包含关键字和/或路径频率信息的大型XML文档的特定部分,允许用户容易地将搜索精简到文档集合内的特定路径。

    MECHANISMS FOR SEARCHING ENTERPRISE DATA GRAPHS
    90.
    发明申请
    MECHANISMS FOR SEARCHING ENTERPRISE DATA GRAPHS 有权
    搜索企业数据图的机制

    公开(公告)号:US20130218899A1

    公开(公告)日:2013-08-22

    申请号:US13398794

    申请日:2012-02-16

    IPC分类号: G06F17/30

    摘要: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

    摘要翻译: 从规范化数据有效地识别非结构化查询的高度相关的搜索结果。 服务器显示每个数据对象之间的关系。 对于每个搜索项,服务器识别映射到该术语的候选数据对象集合。 服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。 基于该图,服务器识别一个或多个搜索结果子图,每个包括来自每个候选集的至少一个数据对象。 服务器按照候选数据对象的优先级得分的顺序查找子图。 服务器可以提前终止其搜索,部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。