-
1.发明授权On-demand generation of correlated collections of mashable data from distributed, non-homogeneous data sources 有权按需生成来自分布式非均匀数据源的可混合数据的相关集合公开(公告)号：US09053184B2
公开(公告)日：2015-06-09
申请号：US13086952
申请日：2011-04-14
CPC分类号： G06F17/30864
摘要： Embodiments of the present invention provide a method, system and computer program product for the on-demand generation of correlated collections of mashable data from distributed, heterogeneous data sources. In an embodiment of the invention, a method for on-demand generation of correlated collections of mashable data from distributed, heterogeneous data sources is provided. The method includes receiving a request for a data feed from a widget in a mashup rendered in a content browser executing in memory of a computer. The method further includes inspecting a virtual database of data aggregated from different data sources over a computer communications network to locate data requisite to returning the data feed to the widget in the mashup. The method yet further includes querying the data of the virtual database to produce the data feed. Finally, the method includes returning the data feed in the format specified to the widget in the mashup.
摘要翻译： 本发明的实施例提供了一种用于按需生成来自分布式异构数据源的可混合数据的相关集合的方法，系统和计算机程序产品。 在本发明的一个实施例中，提供了一种从分布式异构数据源按需生成可混合数据的相关集合的方法。 该方法包括从在计算机的存储器中执行的内容浏览器中呈现的混搭中的窗口小部件接收对数据馈送的请求。 该方法还包括通过计算机通信网络检查从不同数据源聚合的数据的虚拟数据库，以定位在混搭中将数据馈送返回到小部件所必需的数据。 该方法还包括查询虚拟数据库的数据以产生数据馈送。 最后，该方法包括以mashup中的小部件指定的格式返回数据Feed。
-
公开(公告)号：US08959119B2
公开(公告)日：2015-02-17
申请号：US13595356
申请日：2012-08-27
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： A context-based graph-relational intersect derived (CB-GRID) links a real entity graph node to a synthetic entity graph node. The real entity graph node comprises a pointer to a primary key in a first tuple that non-contextually describes the real entity. A primary relational database comprises the first tuple that non-contextually describes the real entity. A context relational database comprises a second tuple that contains a foreign key that matches the primary key in the primary relational database. The second tuple dynamically describes a context of data in the first tuple. A contextual entity relational database comprises a third tuple that contains data from the first tuple and the second tuple. The synthetic entity graph node describes a synthetic entity that is described by data in the third tuple, such that the contextual entity relational database links the real entity graph node to the synthetic entity graph node.
摘要翻译： 基于上下文的图关系相交导出（CB-GRID）将真实实体图节点链接到合成实体图节点。 真实实体图形节点包括指向第一元组中的主键的指针，该第一元组非上下文地描述真实实体。 主关系数据库包括非上下文描述真实实体的第一元组。 上下文关系数据库包括第二元组，其包含与主关系数据库中的主键匹配的外键。 第二个元组动态地描述第一个元组中的数据的上下文。 上下文实体关系数据库包括包含来自第一元组和第二元组的数据的第三元组。 合成实体图节点描述由第三元组中的数据描述的合成实体，使得上下文实体关系数据库将真实实体图节点链接到合成实体图节点。
-
3.发明授权公开(公告)号：US08346532B2
公开(公告)日：2013-01-01
申请号：US12171666
申请日：2008-07-11
IPC分类号： G06F17/30
CPC分类号： G06F21/6209 , G06F19/00 , G06F21/62 , G16H10/60
摘要： A method, information processing system, and computer program storage product for managing information within an electronic file are provided. A plurality of information sets within an electronic file is analyzed. At least one of the information sets is compared to at least one statistical classification model. The statistical classification model includes one or more probabilities associated with a plurality of analyzed information sets that indicate a likelihood that a respective analyzed information set is classified sensitive information. The at least one information set is determined to substantially match at least one analyzed information set in the statistical classification model. The probability associated with the at least one analyzed information set is determined whether to be above a threshold. The at least one information set is classified as sensitive information in response to determining that the probability is above the threshold.
摘要翻译： 提供了一种用于管理电子文件内的信息的方法，信息处理系统和计算机程序存储产品。 分析电子文件内的多个信息集。 将至少一个信息集与至少一个统计分类模型进行比较。 统计分类模型包括与多个分析的信息集相关联的一个或多个概率，其指示相应的分析的信息集合被分类为敏感信息的可能性。 所述至少一个信息集被确定为基本上匹配所述统计分类模型中的至少一个所分析的信息集。 确定与至少一个分析的信息集相关联的概率是否高于阈值。 响应于确定概率高于阈值，将至少一个信息集合分类为敏感信息。
-
公开(公告)号：US09251237B2
公开(公告)日：2016-02-02
申请号：US13610523
申请日：2012-09-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30587 , G06F17/30038 , G06F17/30091 , G06F17/30395 , G06F17/30598 , G06F17/30707 , G06F17/30864 , G06F17/30867
摘要： A processor-implemented method, system, and/or computer program product generates and utilizes a synthetic context-based object to locate a user-specific data store. A processor associates a non-contextual data object with a context object to define a synthetic context-based object. The synthetic context-based object is associated with at least one specific data store that contains data that is associated with data in the non-contextual data object and in the context object. The processor determines a subject-matter of interest for a specific user, and associates that determined subject-matter of interest to a specific synthetic context-based object. In response to receiving a request for data from a specific user, the request is directed to the specific synthetic context-based object that describes the subject-matter of interest for that specific user. This specific synthetic context-based object locates the appropriate data store in order to return the requested data to the specific user.
摘要翻译： 处理器实现的方法，系统和/或计算机程序产品生成并利用合成的基于上下文的对象来定位用户特定的数据存储。 处理器将非上下文数据对象与上下文对象相关联以定义合成的基于上下文的对象。 合成的基于上下文的对象与包含与非上下文数据对象和上下文对象中的数据相关联的数据的至少一个特定数据存储相关联。 处理器确定特定用户感兴趣的主题，并将确定的感兴趣主题与特定合成基于上下文的对象相关联。 响应于接收到来自特定用户的数据的请求，该请求被定向到描述该特定用户的感兴趣主题的特定合成基于上下文的对象。 该特定的合成基于上下文的对象定位适当的数据存储以便将所请求的数据返回给特定的用户。
-
公开(公告)号：US20140074833A1
公开(公告)日：2014-03-13
申请号：US13610523
申请日：2012-09-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30587 , G06F17/30038 , G06F17/30091 , G06F17/30395 , G06F17/30598 , G06F17/30707 , G06F17/30864 , G06F17/30867
摘要： A processor-implemented method, system, and/or computer program product generates and utilizes a synthetic context-based object to locate a user-specific data store. A processor associates a non-contextual data object with a context object to define a synthetic context-based object. The synthetic context-based object is associated with at least one specific data store that contains data that is associated with data in the non-contextual data object and in the context object. The processor determines a subject-matter of interest for a specific user, and associates that determined subject-matter of interest to a specific synthetic context-based object. In response to receiving a request for data from a specific user, the request is directed to the specific synthetic context-based object that describes the subject-matter of interest for that specific user. This specific synthetic context-based object locates the appropriate data store in order to return the requested data to the specific user.
摘要翻译： 处理器实现的方法，系统和/或计算机程序产品生成并利用合成的基于上下文的对象来定位用户特定的数据存储。 处理器将非上下文数据对象与上下文对象相关联以定义合成的基于上下文的对象。 合成的基于上下文的对象与包含与非上下文数据对象和上下文对象中的数据相关联的数据的至少一个特定数据存储相关联。 处理器确定特定用户感兴趣的主题，并将确定的感兴趣主题与特定合成基于上下文的对象相关联。 响应于接收到来自特定用户的数据的请求，该请求被定向到描述该特定用户的感兴趣主题的特定合成基于上下文的对象。 该特定的合成基于上下文的对象定位适当的数据存储以便将所请求的数据返回给特定的用户。
-
公开(公告)号：US20140046981A1
公开(公告)日：2014-02-13
申请号：US13569366
申请日：2012-08-08
IPC分类号： G06F17/30
CPC分类号： G06F17/30587
摘要： A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.
摘要翻译： 用于存储数据结构的基于上下文的图形数据库系统包括存储实体的标识符的实体节点。 数据节点存储关于该实体的非上下文实体数据。 至少一个上下文节点被链接到数据节点。 至少一个上下文节点向数据节点中的非上下文实体数据提供上下文以创建上下文实体数据。 从实体节点到数据节点的指针将数据节点标识符返回到实体节点，以将上下文实体数据链接到实体。
-
公开(公告)号：US08560606B2
公开(公告)日：2013-10-15
申请号：US12917193
申请日：2010-11-01
申请人： Al Chakra , John K. Gerken , Ruthie D. Lyle , Mark Maresh , Eric A. Stegner
发明人： Al Chakra , John K. Gerken , Ruthie D. Lyle , Mark Maresh , Eric A. Stegner
IPC分类号： G06F15/16
CPC分类号： G06Q10/101 , G06Q50/01
摘要： A plurality of mashups created by a plurality of mashup authors indicated as being in a community relevant to a mashup based, at least in part, on social network data are identified in response to indication of a mashup building operation. Frequencies of a plurality of mashup configurations used by the plurality of mashup authors in the plurality of mashups are determined according to data about the plurality of mashups. A set of one or more recommendations that are associated with a set of one or more of the plurality of mashup configurations is generated for the mashup.
摘要翻译： 响应于混搭构建操作的指示，识别由至少部分基于社交网络数据的多个混搭作者所创建的多个混搭被指定为与混搭相关的社区。 根据关于多个混搭的数据来确定由多个混搭中的多个混搭作者使用的多个混搭配置的频率。 为混搭生成与一组或多个混搭配置相关联的一组或多个推荐。
-
公开(公告)号：US20120110073A1
公开(公告)日：2012-05-03
申请号：US12917193
申请日：2010-11-01
申请人： Al Chakra , John K. Gerken , Ruthie D. Lyle , Mark Maresh , Eric A. Stegner
发明人： Al Chakra , John K. Gerken , Ruthie D. Lyle , Mark Maresh , Eric A. Stegner
IPC分类号： G06F15/16
CPC分类号： G06Q10/101 , G06Q50/01
摘要： A plurality of mashups created by a plurality of mashup authors indicated as being in a community relevant to a mashup based, at least in part, on social network data are identified in response to indication of a mashup building operation. Frequencies of a plurality of mashup configurations used by the plurality of mashup authors in the plurality of mashups are determined according to data about the plurality of mashups. A set of one or more recommendations that are associated with a set of one or more of the plurality of mashup configurations is generated for the mashup.
摘要翻译： 响应于混搭构建操作的指示，识别由至少部分基于社交网络数据的多个混搭作者所创建的多个混搭被指定为与混搭相关的社区。 根据关于多个混搭的数据来确定由多个混搭中的多个混搭作者使用的多个混搭配置的频率。 为混搭生成与一组或多个混搭配置相关联的一组或多个推荐。
-
9.发明申请公开(公告)号：US20100011000A1
公开(公告)日：2010-01-14
申请号：US12171666
申请日：2008-07-11
IPC分类号： G06F17/30
CPC分类号： G06F21/6209 , G06F19/00 , G06F21/62 , G16H10/60
摘要： A method, information processing system, and computer program storage product for managing information within an electronic file are provided. A plurality of information sets within an electronic file is analyzed. At least one of the information sets is compared to at least one statistical classification model. The statistical classification model includes one or more probabilities associated with a plurality of analyzed information sets that indicate a likelihood that a respective analyzed information set is classified sensitive information. The at least one information set is determined to substantially match at least one analyzed information set in the statistical classification model. The probability associated with the at least one analyzed information set is determined whether to be above a threshold. The at least one information set is classified as sensitive information in response to determining that the probability is above the threshold.
摘要翻译： 提供了一种用于管理电子文件内的信息的方法，信息处理系统和计算机程序存储产品。 分析电子文件内的多个信息集。 将至少一个信息集与至少一个统计分类模型进行比较。 统计分类模型包括与多个分析的信息集相关联的一个或多个概率，其指示相应的分析的信息集合被分类为敏感信息的可能性。 所述至少一个信息集被确定为基本上匹配所述统计分类模型中的至少一个所分析的信息集。 确定与至少一个分析的信息集相关联的概率是否高于阈值。 响应于确定概率高于阈值，将至少一个信息集合分类为敏感信息。
-
公开(公告)号：US08676857B1
公开(公告)日：2014-03-18
申请号：US13592905
申请日：2012-08-23
IPC分类号： G06F17/30
CPC分类号： G06F17/30958 , G06F17/30587
摘要： A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.
摘要翻译： 图形数据库存储系统包含具有多个图形节点的图形数据库。 第一指针从特定图形节点指向合成上下文事件数据库中的特定合成上下文事件节点。 第二指针从合成上下文事件数据库中的特定合成上下文事件节点指向数据结构中的特定数据存储，使得第一指针和第二指针将特定数据存储与图表数据库中表示的特定实体相关联 通过特定的合成上下文事件节点。
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.024 秒)
