会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for employing a multiple layer cache mechanism to enhance performance of a multi-user information retrieval system
    • 一种采用多层缓存机制提高多用户信息检索系统性能的方法和系统
    • US08326828B2
    • 2012-12-04
    • US12014221
    • 2008-01-15
    • Nianjun ZhouDikran S. MeliksetianYang SunChuan Yang
    • Nianjun ZhouDikran S. MeliksetianYang SunChuan Yang
    • G06F7/00
    • G06F17/30902
    • A method and system for optimizing resource usage in an information retrieval system. Meta information in query results describes data items identified by identifiers. A chunk of the identifiers and a set of meta information are loaded into a first cache and a second cache, respectively. A portion of the set of meta information is being viewed by a user. The portion describes a data item identified by an identifier included in the chunk and in a sub-chunk of identifiers that identifies data items described by the set of meta information. If a position of the identifier in the sub-chunk satisfies a first criterion, then a second set of meta information is preloaded into the second cache. If a position of the identifier in the chunk satisfies a second criterion, then a second chunk of the identifiers is preloaded into the first cache.
    • 一种用于优化信息检索系统中的资源使用的方法和系统。 查询结果中的元信息描述了标识符标识的数据项。 标识符和一组元信息的块分别被加载到第一高速缓存和第二高速缓存中。 一组元信息的一部分正在由用户查看。 该部分描述由标识符识别的标识符的数据项,所述标识符包括在标识符的子块中以及标识符的子块中,该标识符标识由所述一组元信息描述的数据项。 如果子块中的标识符的位置满足第一标准,则将第二组元信息预加载到第二高速缓存中。 如果组块中的标识符的位置满足第二标准,则将第二组标识符预加载到第一高速缓存中。
    • 5. 发明申请
    • METHOD AND SYSTEM FOR WEB PAGE BREADCRUMB
    • 网页浏览方法与系统
    • US20100293546A1
    • 2010-11-18
    • US12755662
    • 2010-04-07
    • Jian LiuDikran S. MeliksetianYang SunZhi Jun Wang
    • Jian LiuDikran S. MeliksetianYang SunZhi Jun Wang
    • G06F15/173G06F9/46
    • G06F17/30873G06F17/2247G06F17/2705G06F17/30578G06F17/30864G06F17/3089G06F17/30961H04L29/0854
    • A breadcrumb method, system and computer program product for a website. In response to a request for visiting the website, a breadcrumb root node is generated in a tree structure. In response to receiving a request for visiting a first web task associated with the website, a first task node is generated in the tree structure at the breadcrumb root node. In response to sequentially receiving requests for multiple subtasks of the first web task, multiple subtask nodes of the first task node are sequentially established in the tree structure. The subtask nodes of the multiple subtask nodes of the first task node are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task. The multiple subtask nodes of the first task node are processed based a policy of the first web task.
    • 网路的面包屑方法,系统和电脑程式产品。 响应于访问该网站的请求,在树结构中生成面包屑根节点。 响应于接收到访问与网站相关联的第一web任务的请求,在路径根节点处的树结构中生成第一任务节点。 响应于顺序地接收对第一web任务的多个子任务的请求,第一任务节点的多个子任务节点在树结构中被顺序地建立。 第一任务节点的多个子任务节点的子任务节点根据对第一web任务的多个子任务的顺序接收的请求的顺序顺序连接到第一任务节点。 基于第一web任务的策略来处理第一任务节点的多个子任务节点。
    • 6. 发明申请
    • METHOD AND SYSTEM FOR EMPLOYING A MULTIPLE LAYER CACHE MECHANISM TO ENHANCE PERFORMANCE OF A MULTI-USER INFORMATION RETRIEVAL SYSTEM
    • 使用多层缓存机制提高多用户信息检索系统性能的方法和系统
    • US20090182946A1
    • 2009-07-16
    • US12014221
    • 2008-01-15
    • Nianjun ZhouDikran S. MeliksetianYang SunChuan Yang
    • Nianjun ZhouDikran S. MeliksetianYang SunChuan Yang
    • G06F12/00
    • G06F17/30902
    • A method and system for optimizing resource usage in an information retrieval system. Meta information in query results describes data items identified by identifiers. A chunk of the identifiers and a set of meta information are loaded into a first cache and a second cache, respectively. A portion of the set of meta information is being viewed by a user. The portion describes a data item identified by an identifier included in the chunk and in a sub-chunk of identifiers that identifies data items described by the set of meta information. If a position of the identifier in the sub-chunk satisfies a first criterion, then a second set of meta information is preloaded into the second cache. If a position of the identifier in the chunk satisfies a second criterion, then a second chunk of the identifiers is preloaded into the first cache.
    • 一种用于优化信息检索系统中的资源使用的方法和系统。 查询结果中的元信息描述了标识符标识的数据项。 标识符和一组元信息的块分别被加载到第一高速缓存和第二高速缓存中。 一组元信息的一部分正在由用户查看。 该部分描述由标识符识别的标识符的数据项,所述标识符包括在标识符的子块中以及标识符的子块中,该标识符标识由所述一组元信息描述的数据项。 如果子块中的标识符的位置满足第一标准,则将第二组元信息预加载到第二高速缓存中。 如果组块中的标识符的位置满足第二标准,则将第二组标识符预加载到第一高速缓存中。
    • 8. 发明授权
    • Memory efficient XML shredding with partial commit
    • 具有部分提交功能的内存高效的XML切割
    • US07363317B2
    • 2008-04-22
    • US11058020
    • 2005-02-15
    • Dikran S. MeliksetianGeorge Andrei MihailaNianjun Zhou
    • Dikran S. MeliksetianGeorge Andrei MihailaNianjun Zhou
    • G06F17/30
    • G06F17/30914Y10S707/99944
    • A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.
    • 一种方法和系统,允许将大型实例的分层数据结构高效地分解成关系数据结构。 能够比用于将它们分割成关系数据结构的计算机的随机存取存储器更大的分级数据结构的大型实例被递增地切割成临时存储器。 当切入临时存储器的数据量达到或超过预定提交计数时,临时存储器中的数据被传送到由关系数据库管理器维护的关系数据结构。 文档类型说明注释用于允许最终用户指定SQL命令的执行顺序并指定提交计数值。