会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • System, and method for interactive browsing
    • 系统和方法进行交互式浏览
    • US07552114B2
    • 2009-06-23
    • US11715090
    • 2007-03-07
    • Li ZhangTao LiuJian Min JiangZhong SuYue Pan
    • Li ZhangTao LiuJian Min JiangZhong SuYue Pan
    • G06F17/30
    • G06F17/30899G06F17/30716Y10S707/99931Y10S707/99933Y10S707/99934
    • A method for achieving interactive browsing includes steps performed by a computer coupled to a knowledge base and a document database. The knowledge base stores a plurality of terms and information relating to each term, and the document database stores a plurality of documents. The steps include acquiring terms in which a user has interest; extracting information relating to the terms in which the user has interest from the knowledge base in order to display the information in a first display part of a user interface; and extracting documents containing the terms in which the user has interest from the document database in order to display a list of extracted documents in a second display part of the user interface.
    • 用于实现交互式浏览的方法包括由耦合到知识库和文档数据库的计算机执行的步骤。 知识库存储与每个术语相关的多个术语和信息,并且文档数据库存储多个文档。 这些步骤包括获取用户感兴趣的术语; 从所述知识库中提取与所述用户感兴趣的术语相关的信息,以便在所述用户界面的第一显示部分中显示所述信息; 以及从文档数据库提取包含用户感兴趣的术语的文档,以便在用户界面的第二显示部分中显示提取的文档的列表。
    • 42. 发明申请
    • Method and Apparatus for Optimizing Queries over Vertically Stored Database
    • 用于优化垂直存储数据库查询的方法和设备
    • US20090132474A1
    • 2009-05-21
    • US12271038
    • 2008-11-14
    • Li MaYue PanChen WangYing Yan
    • Li MaYue PanChen WangYing Yan
    • G06F17/30
    • G06F17/30451
    • A method and device for optimizing queries over a vertically stored database. Items in the database are partitioned into several partitions each having a partition signature. The method includes decomposing a first query received from a user into multiple first subqueries; generating a signature for each first subquery in a way corresponding to the way of generating the partition signature; comparing the signature of each first subquery with partition signatures of all partitions respectively to obtain all partitions matching the first subquery; rewriting a second subquery translated from the first subquery based on the matching partitions to obtain a rewritten second subquery; and composing rewritten second subqueries for all first subqueries to form a second query so that queries are executed over the database using the second query.
    • 一种用于通过垂直存储的数据库优化查询的方法和设备。 数据库中的项目被分成几个具有分区签名的分区。 该方法包括将从用户接收的第一查询分解成多个第一子查询; 以与生成分区签名的方式相对应的方式为每个第一子查询生成签名; 将每个第一子查询的签名分别与所有分区的分区签名进行比较,以获得与第一子查询匹配的所有分区; 基于匹配分区重写从第一子查询翻译的第二子查询,以获得重写的第二子查询; 并为所有第一个子查询组合重写的第二个子查询以形成第二个查询,以便使用第二个查询在数据库上执行查询。
    • 43. 发明申请
    • System and Method for Interactive Browsing
    • 互动浏览的系统和方法
    • US20080313106A1
    • 2008-12-18
    • US12133844
    • 2008-06-05
    • Li ZhangTao LiuJian Min JiangZhong SuYue Pan
    • Li ZhangTao LiuJian Min JiangZhong SuYue Pan
    • G06F17/21G06N5/02
    • G06F17/30899G06F17/30716Y10S707/99931Y10S707/99933Y10S707/99934
    • The present invention provides a system and method for achieving interactive browsing. Said system is coupled to a knowledge base and a document database, said knowledge base stores a plurality of terms and information relating to each term, and said document database stores a plurality of documents. Said system comprises term acquiring means, for acquiring terms in which a user has much interest; first extracting means, for extracting information relating to the terms in which the user has much interest, from the knowledge base; second extracting means, for extracting documents containing the terms in which the user has much interest, from the document database; a first display part in a user interface, for displaying information extracted by the first extracting means; and a second display part in the user interface, for displaying a list of the documents extracted by the second extracting means. With the present invention, one can browse both documents and information on terms in the documents in a single interface.
    • 本发明提供了一种用于实现交互式浏览的系统和方法。 所述系统耦合到知识库和文档数据库,所述知识库存储与每个术语相关的多个术语和信息,并且所述文档数据库存储多个文档。 所述系统包括术语获取装置,用于获取用户感兴趣的术语; 第一提取装置,用于从知识库中提取与用户有兴趣的术语有关的信息; 第二提取装置,用于从文档数据库提取包含用户有兴趣的术语的文档; 用于显示由第一提取装置提取的信息的用户界面中的第一显示部分; 以及用户界面中的第二显示部分,用于显示由第二提取装置提取的文档的列表。 利用本发明,可以在单个界面中浏览文档中的文档和文档中的术语信息。
    • 47. 发明授权
    • Obtaining hierarchical information of planar data
    • 获取平面数据的分层信息
    • US08996581B2
    • 2015-03-31
    • US13332361
    • 2011-12-20
    • Yue PanXing Zhi SunYing TaoLin Hao Xu
    • Yue PanXing Zhi SunYing TaoLin Hao Xu
    • G06F7/00G06F17/30G06Q50/24
    • G06F17/30592G06F19/00G06Q50/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.
    • 本发明提供了一种获取平面数据分层信息的方法和装置。 该方法包括将平面数据中的相同数据集中的至少一个数据项映射到由结构化术语系统形成的树结构中的至少一个节点。 所述方法还包括获得所述树结构中的至少一个子树结构,所述至少一个子树结构中的每一个将所述至少一个节点作为其所有叶节点。 该方法还包括从至少一个子树结构中选择目标树结构并获得目标树结构中的分层信息。 还提供了与上述方法对应的装置。 利用上述方法和装置,可以从平面有组织的数据获得数据项的分层信息,以便于后续和进一步的分析和管理。
    • 48. 发明授权
    • Method and system for determining node to be materialized
    • 确定待实现节点的方法和系统
    • US08768953B2
    • 2014-07-01
    • US12913570
    • 2010-10-27
    • Yue PanXing Zhi SunLin Hao Xu
    • Yue PanXing Zhi SunLin Hao Xu
    • G06F7/00
    • 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.
    • 获得没有强连接子图的规则谓词的依赖图。 依赖图表示规则谓词之间的依赖关系。 计算依赖图中节点的更新频率,并计算依赖图中节点的查询频率。 此外,基于查询频率和更新频率来计算节点的运行时查询成本值和实现成本值。 基于运行时查询成本值和实现成本值确定要实现的节点。 与要实现的节点相对应的规则谓词是要实现的规则谓词。 在至少一些情况下,示例性的技术效果是,当在关系数据推理系统构造的规则谓词中执行查询时,保存运行时查询的结果的返回时间,并且减少数据更新的影响。