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

1. 发明申请

US20060190425A1 Method for merging multiple ranked lists with bounded memory 审中-公开
标题翻译：将多个排名列表与有界记忆合并的方法
公开(公告)号：US20060190425A1
公开(公告)日：2006-08-24
申请号：US11064605
申请日：2005-02-24
申请人： Yuan-Chi Chang , Christian Lang , Apostol Natsev , Sriram Padmanabhan , Min Wang , Ioana Stanoi
发明人： Yuan-Chi Chang , Christian Lang , Apostol Natsev , Sriram Padmanabhan , Min Wang , Ioana Stanoi
IPC分类号： G06F17/30
CPC分类号： G06F16/5838 , G06F16/24549
摘要： Systems and methods for conducting attribute-based queries over a plurality of objects using bounded memory locations and minimizing costly input and output operations are provided. A plurality of attributes are associated with each object, and a plurality of data groups, one each for the identified attributes are created. The objects associated with the attributes are placed into the appropriate data groups, and the objects contained within each data group are sorted into blocks such that each block within a given attribute contains that objects having the same attribute value. Results to the query are created by loading blocks into a primary memory location in a middleware system and combining the loaded blocks to create the desire query results. Block combinations are created based upon the fit of the given block combination to the query as expressed in an aggregation function. A second dedicated memory location can also be provided to hold multiple block combinations to optimize the order in which blocks are loaded and combined. Empty block buffers and external storage devices can also be provided to further enhance the generation of query results.
摘要翻译：提供了使用有限存储器位置对多个对象进行基于属性的查询并最小化昂贵的输入和输出操作的系统和方法。多个属性与每个对象相关联，并且创建多个数据组，每个数据组各自用于所识别的属性。与属性相关联的对象被放置到适当的数据组中，并且每个数据组中包含的对象被排序成块，使得给定属性中的每个块包含具有相同属性值的对象。通过将块加载到中间件系统中的主存储器位置并组合加载的块以创建期望查询结果来创建查询的结果。基于给定块组合对于在聚合函数中表达的查询的拟合来创建块组合。还可以提供第二专用存储器位置以保持多个块组合以优化块被加载和组合的顺序。还可以提供空块缓冲区和外部存储设备，以进一步增强查询结果的生成。

2. 发明授权

US07174328B2 Selective path signatures for query processing over a hierarchical tagged data structure 失效
标题翻译：用于通过分层标记数据结构进行查询处理的选择性路径签名
公开(公告)号：US07174328B2
公开(公告)日：2007-02-06
申请号：US10653550
申请日：2003-09-02
申请人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
发明人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/30961 , G06F17/30917 , Y10S707/99933
摘要： A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.
摘要翻译：一种在具有存储器的计算系统中具有多个节点的分层标记数据结构上利用一个或多个提示进行查询处理的方法，如果存在可从子节点自顶向下遍历的标签，则该提示为肯定的;以及否则为负。对于数据结构中的每个标签，该方法计算所有位设置为1的当前节点的位图，并为每个子节点计算所有子位图的AND位，并设置与当前标签的标签ID相对应的位如果存在这样的当前标签，则为零。该方法还将当前标签的位设置为0，为每个子节点计算多个可能的非冗余提示，并刷新提示列表。

3. 发明申请

US20050050016A1 Selective path signatures for query processing over a hierarchical tagged data structure 失效
标题翻译：用于通过分层标记数据结构进行查询处理的选择性路径签名
公开(公告)号：US20050050016A1
公开(公告)日：2005-03-03
申请号：US10653550
申请日：2003-09-02
申请人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
发明人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30961 , G06F17/30917 , Y10S707/99933
摘要： A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.
摘要翻译：一种在具有存储器的计算系统中具有多个节点的分层标记数据结构上利用一个或多个提示进行查询处理的方法，如果存在可从子节点自顶向下遍历的标签，则该提示为肯定的;以及否则为负。对于数据结构中的每个标签，该方法计算所有位设置为1的当前节点的位图，并为每个子节点计算所有子位图的AND位，并设置与当前标签的标签ID相对应的位如果存在这样的当前标签，则为零。该方法还将当前标签的位设置为0，为每个子节点计算多个可能的非冗余提示，并刷新提示列表。

4. 发明申请

US20070255613A1 Method and apparatus for execution of a process 审中-公开
标题翻译：用于执行过程的方法和装置
公开(公告)号：US20070255613A1
公开(公告)日：2007-11-01
申请号：US11415746
申请日：2006-05-01
申请人： Yuan-Chi Chang , Christian Lang , John Smith , Ioana Stanoi
发明人： Yuan-Chi Chang , Christian Lang , John Smith , Ioana Stanoi
IPC分类号： G06Q10/00 , G07G1/00 , G06Q30/00 , G06F17/30
CPC分类号： G06Q10/10 , G06F12/0862 , G06F2212/602 , G06Q10/06
摘要： Techniques are provided for enabling execution of a process employing a cache. Method steps can include obtaining a first probability of accessing a given artifact in a state Si, obtaining a second probability of using a predicate from a current state Sc in the state Si, determining a benefit of prefetching the given artifact using the predicate based on at least the first probability and the second probability, and whether and/or when a cache replacement should be conducted, based at least on the benefit determined.
摘要翻译：提供了用于使得能够执行采用高速缓存的过程的技术。方法步骤可以包括获得在状态S中访问给定人造物的第一概率，获得在该状态下使用来自当前状态S> C的谓词的第二概率基于至少第一概率和第二概率来确定使用谓词预取给定工件的优点，以及是否和/或何时应当执行高速缓存替换，至少基于确定好处。

5. 发明申请

US20090216694A1 MAXIMIZATION OF SUSTAINED THROUGHPUT OF DISTRIBUTED CONTINUOUS QUERIES 失效
标题翻译：最大化分布式连续查询的持续性分析
公开(公告)号：US20090216694A1
公开(公告)日：2009-08-27
申请号：US12371715
申请日：2009-02-16
申请人： CHRISTIAN A. LANG , George Andrei Mihaila , Themis Palpanas , Ioana Stanoi
发明人： CHRISTIAN A. LANG , George Andrei Mihaila , Themis Palpanas , Ioana Stanoi
IPC分类号： G06F15/18 , G06F15/177 , G06F15/16
CPC分类号： G06F17/30516 , H04L65/602 , H04L65/80
摘要： A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.
摘要翻译：公开了一种用于优化流处理系统的吞吐量的系统，方法和计算机可读介质。该方法包括分析一组输入流并且基于分析创建输入流集合中的至少一个输入流的输入简档。输入简档包括与输入流相关联的至少一组处理要求。该方法还包括基于包括与输入流相关联的多个配置的初始配置来生成搜索空间。基于输入简档和系统资源中的至少一个，识别出多个配置中的配置，其增加了多个配置中的其他配置的吞吐量。

6. 发明申请

US20090216899A1 REDUCTION OF MESSAGE FLOW BETWEEN BUS-CONNECTED CONSUMERS AND PRODUCERS 失效
标题翻译：减少总线连接消费者和生产者之间的消息流量
公开(公告)号：US20090216899A1
公开(公告)日：2009-08-27
申请号：US12434840
申请日：2009-05-04
申请人： Jun-Jang Jeng , Christian A. Lang , Ioana Stanoi
发明人： Jun-Jang Jeng , Christian A. Lang , Ioana Stanoi
IPC分类号： G06F15/16
CPC分类号： H04L12/40 , H04L12/4013
摘要： A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus.
摘要翻译：公开了一种用于减少消息总线上的消息流的系统，方法和计算机可读介质。该方法包括确定多个逻辑运算符中的至少一个逻辑运算符是否需要对一组物理节点中的给定物理处理节点进行处理。响应于确定逻辑运算符需要对给定物理处理节点进行处理，逻辑运算符被固定到给定的物理处理节点。多个逻辑运算符中的每个逻辑运算符被分配给消息总线上的物理处理节点组中的初始物理处理节点。

7. 发明申请

US20080028098A1 Reduction of message flow between bus-connected consumers and producers 失效
标题翻译：总线连接的消费者和生产者之间的消息流量减少
公开(公告)号：US20080028098A1
公开(公告)日：2008-01-31
申请号：US11495312
申请日：2006-07-27
申请人： Jun-Jang Jeng , Christian A. Lang , Ioana Stanoi
发明人： Jun-Jang Jeng , Christian A. Lang , Ioana Stanoi
IPC分类号： G06F15/173
CPC分类号： H04L12/40 , H04L12/4013
摘要： A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus.
摘要翻译：公开了一种用于减少消息总线上的消息流的系统，方法和计算机可读介质。该方法包括确定多个逻辑运算符中的至少一个逻辑运算符是否需要对一组物理节点中的给定物理处理节点进行处理。响应于确定逻辑运算符需要对给定物理处理节点进行处理，逻辑运算符被固定到给定的物理处理节点。多个逻辑运算符中的每个逻辑运算符被分配给消息总线上的物理处理节点组中的初始物理处理节点。

8. 发明授权

US07853545B2 Preserving privacy of one-dimensional data streams using dynamic correlations 失效
标题翻译：使用动态相关性保护一维数据流的隐私
公开(公告)号：US07853545B2
公开(公告)日：2010-12-14
申请号：US11678786
申请日：2007-02-26
申请人： Yuan-Chi Chang , Feifei Li , Spyridon Papadimitriou , George A. Mihaila , Ioana Stanoi , Jimeng Sun , Philip S. Yu
发明人： Yuan-Chi Chang , Feifei Li , Spyridon Papadimitriou , George A. Mihaila , Ioana Stanoi , Jimeng Sun , Philip S. Yu
IPC分类号： G06F17/00
CPC分类号： H04L63/0407 , G06F21/6245 , G06F2207/7219
摘要： Disclosed is a method, information processing system, and computer readable medium for preserving privacy of nonstationary data streams. The method includes receiving at least one nonstationary data stream with time dependent data. Calculating, for a given instant of sub-space of time, A set of first-moment statistical values is calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.
摘要翻译：公开了一种用于保持非平稳数据流的隐私的方法，信息处理系统和计算机可读介质。该方法包括接收具有时间相关数据的至少一个非平稳数据流。对于给定时间子空间的计算，对于数据的子时间空间的给定时刻，计算一组一阶统计值。第一时刻统计值包括时间子空间的主成分。数据按照与主要分量成比例的噪声与第一时刻的统计值相互扰动，使得数据的至少一部分二阶统计值仅在预定方差内被噪声扰动。

9. 发明授权

US07496683B2 Maximization of sustained throughput of distributed continuous queries 失效
标题翻译：分布式连续查询的持续吞吐量最大化
公开(公告)号：US07496683B2
公开(公告)日：2009-02-24
申请号：US11494331
申请日：2006-07-27
申请人： Christian A. Lang , George Andrei Mihaila , Themis Palpanas , Ioana Stanoi
发明人： Christian A. Lang , George Andrei Mihaila , Themis Palpanas , Ioana Stanoi
IPC分类号： G06F15/173
CPC分类号： G06F17/30516 , H04L65/602 , H04L65/80
摘要： A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.
摘要翻译：公开了一种用于优化流处理系统的吞吐量的系统，方法和计算机可读介质。该方法包括分析一组输入流并且基于分析创建输入流集合中的至少一个输入流的输入简档。输入简档包括与输入流相关联的至少一组处理要求。该方法还包括基于包括与输入流相关联的多个配置的初始配置来生成搜索空间。基于输入简档和系统资源中的至少一个，识别出多个配置中的配置，其增加了多个配置中的其他配置的吞吐量。

10. 发明申请

US20080205641A1 PRESERVING PRIVACY OF ONE-DIMENSIONAL DATA STREAMS USING DYNAMIC AUTOCORRELATION 失效
标题翻译：使用动态自动保存保护一维数据流的隐私
公开(公告)号：US20080205641A1
公开(公告)日：2008-08-28
申请号：US11678808
申请日：2007-02-26
申请人： Yuan-Chi Chang , Feifei Li , Spyridon Papadimitriou , George A. Mihaila , Ioana Stanoi , Jimeng Sun , Philip S. Yu
发明人： Yuan-Chi Chang , Feifei Li , Spyridon Papadimitriou , George A. Mihaila , Ioana Stanoi , Jimeng Sun , Philip S. Yu
IPC分类号： H04L9/18
CPC分类号： G06F21/755
摘要： A method, information processing system, and computer readable medium are provided for preserving privacy of one-dimensional nonstationary data streams. The method includes receiving a one-dimensional nonstationary data stream. A set of first-moment statistical values are calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.
摘要翻译：提供了一种方法，信息处理系统和计算机可读介质，用于保持一维非平稳数据流的隐私。该方法包括接收一维非平稳数据流。对于数据的子时间空间的给定时刻，计算一组一阶统计值。第一时刻统计值包括时间子空间的主成分。数据按照与主要分量成比例的噪声与第一时刻的统计值相互扰动，使得数据的至少一部分二维统计值仅在预定方差内被噪声扰动。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式