会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Mapping of an RDBMS schema onto a multidimensional data model
    • 将RDBMS模式映射到多维数据模型
    • US06768986B2
    • 2004-07-27
    • US09826425
    • 2001-04-03
    • Jean-Yves CrasHenri BiestroRicardo Polo-Malouvier
    • Jean-Yves CrasHenri BiestroRicardo Polo-Malouvier
    • G06F1730
    • G06F17/30592G06F17/30398Y10S707/99932Y10S707/99943Y10S707/99944Y10S707/99945
    • A Relational Database Management System (RDBMS) having any arbitrary structure is translated into a multi-dimensional data model suitable for performing OLAP operations upon. If a relational table defining the relational model includes any tables with cardinality of 1,1 or 0,1, the tables are merged into a single table. If the relational table is not normalized, then normalization is performed and a relationship between the original table and the normalized table is created. If the relational table is normalized, but not by dependence between columns, such as in the dimension table in a snowflake schema, the normalization process is performed using the foreign key in order to generate the normalized table. Once the normalized table is generated, OLAP measures are derived from the normalized relational table by an automated method. In addition, OLAP dimensions are derived from the normalized relational table and the results of the OLAP measures derivation by an automated method according to the present invention. According to an aspect, it is possible to associate a member of a dimension to another member of the same or another dimension. According to another aspect, it is possible to create a new dimension of analysis, the members of which are all the different values that a scalar expression can take on. According to yet another aspect, it is possible to access the various instances of a Reporting Object as members in an OLAP dimension. According to the yet another aspect, it is possible to apply opaque filters or a combination of them to the data that underlies analysis.
    • 具有任意结构的关系数据库管理系统(RDBMS)被翻译成适用于执行OLAP操作的多维数据模型。 如果定义关系模型的关系表包含基数为1,1或0,1的任何表,则表被合并到单个表中。 如果关系表未被归一化,则执行归一化,并且创建原始表与归一化表之间的关系。 如果关系表被归一化,而不是列之间的依赖,例如在雪花模式的维度表中,则使用外键执行归一化过程以生成归一化表。 一旦生成了规范化表,就可以通过自动化方法从归一化关系表导出OLAP度量。 另外,从归一化关系表导出OLAP维度,并且通过根据本发明的自动化方法推导OLAP测量结果。 根据一个方面,可以将尺寸的构件与相同或另一维度的另一个构件相关联。 根据另一方面,可以创建分析的新维度,其成员是标量表达式可以承担的所有不同的值。 根据另一方面,可以将报告对象的各种实例作为OLAP维度中的成员访问。 根据另一方面,可以将不透明滤光片或它们的组合应用于基于分析的数据。
    • 14. 发明授权
    • Situational resource rating
    • 情境资源评级
    • US08374990B2
    • 2013-02-12
    • US12618271
    • 2009-11-13
    • Raphaël ThollotJean-Yves CrasMarie-Aude Aufaure
    • Raphaël ThollotJean-Yves CrasMarie-Aude Aufaure
    • G06F17/00G06N7/04
    • G06Q30/02
    • A computer-implemented system may include determination of a similarity of a semantic projection of a set of interests of a first user to a semantic projection of a first resource, wherein the semantic projection of the set of interests of the first user and the semantic projection of the first resource conforms to a common semantic projection model. Also included may be determination of a semantic interest of the first user for the first resource in a first context based on the similarity of the semantic projection of the set of the interests of the first user to the semantic projection of the first resource, and determination of an interest measure associated with the first user, the first resource and the first context based on a rating prediction for the first user to the first resource in the first context and on the determined semantic interest of the first user for the first resource in the first context.
    • 计算机实现的系统可以包括确定第一用户的一组兴趣的语义投影与第一资源的语义投影的相似性,其中第一用户的一组兴趣的语义投影和语义投影 的第一个资源符合一个共同的语义投影模型。 还包括可以基于第一用户的兴趣集合的语义投影与第一资源的语义投影的相似度来确定第一用户对第一资源的语义兴趣,以及确定 基于第一用户对第一上下文中的第一资源的评级预测以及第一用户对第一资源的确定的语义兴趣,与第一用户相关联的兴趣度量,第一资源和第一上下文 第一个上下文。
    • 16. 发明申请
    • SITUATIONAL RESOURCE RATING
    • 情况资源评估
    • US20100312746A1
    • 2010-12-09
    • US12618271
    • 2009-11-13
    • Raphäel ThollotJean-Yves CrasMarie-Aude Aufaure
    • Raphäel ThollotJean-Yves CrasMarie-Aude Aufaure
    • G06N5/04
    • G06Q30/02
    • A computer-implemented system may include determination of a similarity of a semantic projection of a set of interests of a first user to a semantic projection of a first resource, wherein the semantic projection of the set of interests of the first user and the semantic projection of the first resource conforms to a common semantic projection model. Also included may be determination of a semantic interest of the first user for the first resource in a first context based on the similarity of the semantic projection of the set of the interests of the first user to the semantic projection of the first resource, and determination of an interest measure associated with the first user, the first resource and the first context based on a rating prediction for the first user to the first resource in the first context and on the determined semantic interest of the first user for the first resource in the first context.
    • 计算机实现的系统可以包括确定第一用户的一组兴趣的语义投影与第一资源的语义投影的相似性,其中第一用户的一组兴趣的语义投影和语义投影 的第一个资源符合一个共同的语义投影模型。 还包括可以基于第一用户的兴趣集合的语义投影与第一资源的语义投影的相似度来确定第一用户对第一资源的语义兴趣,以及确定 基于第一用户对第一上下文中的第一资源的评级预测以及第一用户对第一资源的确定的语义兴趣,与第一用户相关联的兴趣度量,第一资源和第一上下文 第一个上下文。
    • 19. 发明授权
    • Processing queries using oriented query paths
    • 使用定向查询路径处理查询
    • US09229982B2
    • 2016-01-05
    • US12343371
    • 2008-12-23
    • Jean-Yves Cras
    • Jean-Yves Cras
    • G06F17/30
    • G06F17/30466
    • A computer readable storage medium includes executable instructions to specify a set of database tables defining vertices and database joins defining oriented edges to form a graph. The oriented edges specify directionality characterizing dependent relationships between database tables. A query path in the graph is identified. The graph is split into a set of directed acyclic graphs. Each directed acyclic graph has a single root vertex that does not form a path to itself through oriented edges. Selected oriented edges are removed from each directed acyclic graph to form a tree corresponding to each directed acyclic graph. The tree is a sub-graph of a directed acyclic graph without loops and one list of joins relates any two database tables in the tree. A database query is generated for each tree. The database query is applied to database tables to form query results. The query results are displayed.
    • 计算机可读存储介质包括用于指定定义顶点的数据库表的集合的可执行指令和定义定向边缘以形成图形的数据库连接。 定向边缘指定表征数据库表之间依赖关系的方向性。 识别图中的查询路径。 该图被分成一组有向无环图。 每个有向无环图具有单个根顶点,其不会通过定向边缘形成自身的路径。 从每个有向无环图中移除所选择的定向边以形成对应于每个有向无环图的树。 树是没有循环的有向无环图的子图,一个连接列表与树中的任何两个数据库表相关联。 为每个树生成一个数据库查询。 数据库查询应用于数据库表以形成查询结果。 显示查询结果。