专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120173585A1 OBTAINING HIERARCHICAL INFORMATION OF PLANAR DATA 有权
标题翻译：获取平面数据的分层信息
公开(公告)号：US20120173585A1
公开(公告)日：2012-07-05
申请号：US13332361
申请日：2011-12-20
申请人： Yue Pan , Xing Zhi Sun , Ying Tao , Lin Hao Xu
发明人： Yue Pan , Xing Zhi Sun , Ying Tao , Lin Hao Xu
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F19/00 , G06Q50/24
摘要： The invention provides a method and apparatus for obtaining hierarchical information of planar data. The method comprises mapping at least one data item from a same data set in the planar data to at least one node in a tree structure formed by a structured terminology system. The method also comprises obtaining at least one sub tree structure in the tree structure, each of the at least one sub tree structure taking the at least one node as all of its leaf node. The method also comprises selecting a target tree structure from the at least one sub tree structure and obtaining hierarchical information in the target tree structure. An apparatus corresponding to the above method is also provided. With the above method and apparatus, hierarchical information of data items may be obtained from planar organized data to facilitate subsequent and further analysis and management.
摘要翻译：本发明提供了一种获取平面数据分层信息的方法和装置。该方法包括将平面数据中的相同数据集中的至少一个数据项映射到由结构化术语系统形成的树结构中的至少一个节点。所述方法还包括获得所述树结构中的至少一个子树结构，所述至少一个子树结构中的每一个将所述至少一个节点作为其所有叶节点。该方法还包括从至少一个子树结构中选择目标树结构并获得目标树结构中的分层信息。还提供了与上述方法对应的装置。利用上述方法和装置，可以从平面有组织的数据获得数据项的分层信息，以便于后续和进一步的分析和管理。

2. 发明授权

US08996581B2 Obtaining hierarchical information of planar data 有权
标题翻译：获取平面数据的分层信息
公开(公告)号：US08996581B2
公开(公告)日：2015-03-31
申请号：US13332361
申请日：2011-12-20
申请人： Yue Pan , Xing Zhi Sun , Ying Tao , Lin Hao Xu
发明人： Yue Pan , Xing Zhi Sun , Ying Tao , Lin Hao Xu
IPC分类号： G06F7/00 , G06F17/30 , G06Q50/24
CPC分类号： G06F17/30592 , G06F19/00 , G06Q50/24
摘要： The invention provides a method and apparatus for obtaining hierarchical information of planar data. The method comprises mapping at least one data item from a same data set in the planar data to at least one node in a tree structure formed by a structured terminology system. The method also comprises obtaining at least one sub tree structure in the tree structure, each of the at least one sub tree structure taking the at least one node as all of its leaf node. The method also comprises selecting a target tree structure from the at least one sub tree structure and obtaining hierarchical information in the target tree structure. An apparatus corresponding to the above method is also provided. With the above method and apparatus, hierarchical information of data items may be obtained from planar organized data to facilitate subsequent and further analysis and management.
摘要翻译：本发明提供了一种获取平面数据分层信息的方法和装置。该方法包括将平面数据中的相同数据集中的至少一个数据项映射到由结构化术语系统形成的树结构中的至少一个节点。所述方法还包括获得所述树结构中的至少一个子树结构，所述至少一个子树结构中的每一个将所述至少一个节点作为其所有叶节点。该方法还包括从至少一个子树结构中选择目标树结构并获得目标树结构中的分层信息。还提供了与上述方法对应的装置。利用上述方法和装置，可以从平面有组织的数据获得数据项的分层信息，以便于后续和进一步的分析和管理。

3. 发明申请

US20110106843A1 METHOD AND SYSTEM FOR DETERMINING NODE TO BE MATERIALIZED 有权
标题翻译：用于确定要素材的节点的方法和系统
公开(公告)号：US20110106843A1
公开(公告)日：2011-05-05
申请号：US12913570
申请日：2010-10-27
申请人： Yue Pan , Xing Zhi Sun , Lin Hao Xu
发明人： Yue Pan , Xing Zhi Sun , Lin Hao Xu
IPC分类号： G06F17/30
CPC分类号： G06F17/30457
摘要： A dependency graph of rule predicates without strongly connected sub-graph is obtained. The dependency graph indicates the dependency among the rule predicates. An update frequency of node in the dependency graph is calculated, and a query frequency of node in the dependency graph is also calculated. Furthermore, a runtime query cost value and a materialization cost value of the node are calculated based on the query frequency and update frequency. Node to be materialized are determined based on the runtime query cost value and the materialization cost value. A rule predicate corresponding to the node to be materialized is the rule predicate to be materialized. In at least some instances, an exemplary technical effect is that the return time of result of runtime query is saved and the affect by the data update is reduced when a query is performed in relation data reasoning system constructed with rule predicates.
摘要翻译：获得没有强连接子图的规则谓词的依赖图。依赖图表示规则谓词之间的依赖关系。计算依赖图中节点的更新频率，并计算依赖图中节点的查询频率。此外，基于查询频率和更新频率来计算节点的运行时查询成本值和实现成本值。基于运行时查询成本值和实现成本值确定要实现的节点。与要实现的节点相对应的规则谓词是要实现的规则谓词。在至少一些情况下，示例性的技术效果是，当在关系数据推理系统构造的规则谓词中执行查询时，保存运行时查询的结果的返回时间，并且减少数据更新的影响。

4. 发明授权

US08768953B2 Method and system for determining node to be materialized 有权
标题翻译：确定待实现节点的方法和系统
公开(公告)号：US08768953B2
公开(公告)日：2014-07-01
申请号：US12913570
申请日：2010-10-27
申请人： Yue Pan , Xing Zhi Sun , Lin Hao Xu
发明人： Yue Pan , Xing Zhi Sun , Lin Hao Xu
IPC分类号： G06F7/00
CPC分类号： G06F17/30457
摘要： A dependency graph of rule predicates without strongly connected sub-graph is obtained. The dependency graph indicates the dependency among the rule predicates. An update frequency of node in the dependency graph is calculated, and a query frequency of node in the dependency graph is also calculated. Furthermore, a runtime query cost value and a materialization cost value of the node are calculated based on the query frequency and update frequency. Node to be materialized are determined based on the runtime query cost value and the materialization cost value. A rule predicate corresponding to the node to be materialized is the rule predicate to be materialized. In at least some instances, an exemplary technical effect is that the return time of result of runtime query is saved and the affect by the data update is reduced when a query is performed in relation data reasoning system constructed with rule predicates.
摘要翻译：获得没有强连接子图的规则谓词的依赖图。依赖图表示规则谓词之间的依赖关系。计算依赖图中节点的更新频率，并计算依赖图中节点的查询频率。此外，基于查询频率和更新频率来计算节点的运行时查询成本值和实现成本值。基于运行时查询成本值和实现成本值确定要实现的节点。与要实现的节点相对应的规则谓词是要实现的规则谓词。在至少一些情况下，示例性的技术效果是，当在关系数据推理系统构造的规则谓词中执行查询时，保存运行时查询的结果的返回时间，并且减少数据更新的影响。

5. 发明申请

US20120136875A1 PREFETCHING RDF TRIPLE DATA 审中-公开
标题翻译：预制RDF三重数据
公开(公告)号：US20120136875A1
公开(公告)日：2012-05-31
申请号：US13305116
申请日：2011-11-28
申请人： Yue Pan , Xing Zhi Sun , Qing Fa Wang , Shuo Wu , Lin Hao Xu
发明人： Yue Pan , Xing Zhi Sun , Qing Fa Wang , Shuo Wu , Lin Hao Xu
IPC分类号： G06F17/30
CPC分类号： G06F16/24578 , G06F16/24539 , G06F16/2455 , G06F16/24558 , G06F16/2458 , G06F16/9574
摘要： Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.
摘要翻译：获得对RDF三元组的查询请求，其中查询请求包含至少一个三重模式; 对于每个三重图案，确定对应的基本图案，并且将每个三重图案转换为加权基本图案。基于加权基本模式计算每个基本图案的出现频率; 至少根据发生频率选择至少一个基本模式; 并且对应于所选择的至少基本图案的RDF三元组被预取到缓冲器中。还提供了相应的装置。利用上述方法和装置，可以确定频繁访问的RDF三元组并将其预取到缓冲器中，这提高了查询效率。

6. 发明授权

US08275784B2 Translation system and method for SPARQL queries 失效
标题翻译： SPARQL查询的翻译系统和方法
公开(公告)号：US08275784B2
公开(公告)日：2012-09-25
申请号：US12732240
申请日：2010-03-26
申请人： Feng Cao , Gang Hu , Li Ma , Yue Pan , Xing Zhi Sun
发明人： Feng Cao , Gang Hu , Li Ma , Yue Pan , Xing Zhi Sun
IPC分类号： G06F7/00
CPC分类号： G06F17/30448
摘要： A computer-implemented system and method for translating a SPARQL query. The system includes: a parser/lexer for parsing the SPARQL query; a hidden negative pattern detector for detecting a hidden negative pattern in the parsed SPARQL query; a hidden negative pattern translator for translating the detected hidden negative pattern into an explicit negative pattern; a separator for separating the explicit negative pattern from a positive pattern in the parsed SPARQL query; a negative pattern translator for translating the explicit negative pattern into a negative portion of an SQL statement; a positive pattern translator for translating the positive pattern into a positive portion of the SQL statement; and an SQL statement combiner for combining the negative portion of the SQL statement with the positive portion of the SQL statement.
摘要翻译：用于翻译SPARQL查询的计算机实现的系统和方法。该系统包括：用于解析SPARQL查询的解析器/词法分析器; 隐藏的负模式检测器，用于检测解析的SPARQL查询中的隐藏消极模式; 隐藏的负模式翻译器，用于将检测到的隐藏负模式转换成明确的负模式; 用于将解析的SPARQL查询中的显式负模式与正模式分离的分隔符; 用于将显式负模式转换为SQL语句的负部分的负模式转换器; 一个积极的模式翻译器，用于将积极模式转换为SQL语句的正面部分; 以及SQL语句组合器，用于将SQL语句的负部分与SQL语句的正部分组合。

7. 发明申请

US20100250577A1 TRANSLATION SYSTEM AND METHOD FOR SPARQL QUERIES 失效
标题翻译： SPARQL QUERIES的翻译系统和方法
公开(公告)号：US20100250577A1
公开(公告)日：2010-09-30
申请号：US12732240
申请日：2010-03-26
申请人： Feng Cao , Gang Hu , Li Ma , Yue Pan , Xing Zhi Sun
发明人： Feng Cao , Gang Hu , Li Ma , Yue Pan , Xing Zhi Sun
IPC分类号： G06F17/30
CPC分类号： G06F17/30448
摘要： A computer-implemented system and method for translating a SPARQL query. The system includes: a parser/lexer for parsing the SPARQL query; a hidden negative pattern detector for detecting a hidden negative pattern in the parsed SPARQL query; a hidden negative pattern translator for translating the detected hidden negative pattern into an explicit negative pattern; a separator for separating the explicit negative pattern from a positive pattern in the parsed SPARQL query; a negative pattern translator for translating the explicit negative pattern into a negative portion of an SQL statement; a positive pattern translator for translating the positive pattern into a positive portion of the SQL statement; and an SQL statement combiner for combining the negative portion of the SQL statement with the positive portion of the SQL statement.
摘要翻译：用于翻译SPARQL查询的计算机实现的系统和方法。该系统包括：用于解析SPARQL查询的解析器/词法分析器; 隐藏的负模式检测器，用于检测解析的SPARQL查询中的隐藏消极模式; 隐藏的负模式翻译器，用于将检测到的隐藏负模式转换成显式负模式; 用于将解析的SPARQL查询中的显式负模式与正模式分离的分隔符; 用于将显式负模式转换为SQL语句的负部分的负模式转换器; 一个积极的模式翻译器，用于将积极模式转换为SQL语句的正面部分; 以及用于将SQL语句的负部分与SQL语句的正部分组合的SQL语句组合器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式