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

1. 发明授权

US09047349B2 Methods for effective processing of time series 有权
标题翻译：时间序列有效处理方法
公开(公告)号：US09047349B2
公开(公告)日：2015-06-02
申请号：US12753388
申请日：2010-04-02
申请人： Guy Shaked , Vladimir Braverman , Victor Belyaev , Gabby Rubin , Marina Sadetsky
发明人： Guy Shaked , Vladimir Braverman , Victor Belyaev , Gabby Rubin , Marina Sadetsky
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30551 , G06F17/30595 , G06F17/30598 , G06F17/30864
摘要： A method of effectively representing and processing data sets with time series is disclosed. The method may comprise representing time series as a virtual part of data in a data store layer of a user system, thereby allowing processing of time-series related queries in said data store layer of said user system.
摘要翻译：公开了一种以时间序列有效地表示和处理数据集的方法。该方法可以包括将时间序列表示为用户系统的数据存储层中的数据的虚拟部分，从而允许在所述用户系统的所述数据存储层中处理时间序列相关查询。

2. 发明申请

US20090327217A1 METHOD AND SYSTEM FOR CREATION AND DYNAMIC UPDATING OF BEST DATA ARRANGEMENT IN DIGITAL DATA STORE SYSTEM 有权
标题翻译：用于数字数据存储系统中最佳数据安排的创建和动态更新的方法和系统
公开(公告)号：US20090327217A1
公开(公告)日：2009-12-31
申请号：US12490981
申请日：2009-06-24
申请人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
发明人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30424
摘要： The current invention is a method and a system for analyzing templates of queries, with different levels of precision. When the system of the current invention takes a decision to arrange data, these templates are used, and a single data arrangement object (HRBlob) is designed which may serve a single template or several templates and not just a single query. This approach has an important impact on data arrangement performance and on queries performance, since this approach may help many more queries to be handled using less data arrangement objects.
摘要翻译：本发明是用于分析不同级别精度的查询模板的方法和系统。当本发明的系统决定排列数据时，使用这些模板，并且设计单个数据排列对象（HRBlob），其可以提供单个模板或多个模板，而不仅仅是单个查询。这种方法对数据排列性能和查询性能有重要的影响，因为这种方法可以帮助使用较少的数据排列对象来处理更多的查询。

3. 发明授权

US08364697B2 Method and system for creation and dynamic updating of best data arrangement in digital data store system 有权
标题翻译：数字数据存储系统中最佳数据排列的创建和动态更新的方法和系统
公开(公告)号：US08364697B2
公开(公告)日：2013-01-29
申请号：US12490981
申请日：2009-06-24
申请人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
发明人： Yossi Matias , Guy Shaked , Vladimir Braverman , Victor Belyaev , Shahar Golan , Marina Sadetsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30424
摘要： The current invention is a method and a system for analyzing templates of queries, with different levels of precision. When the system of the current invention takes a decision to arrange data, these templates are used, and a single data arrangement object (HRBlob) is designed which may serve a single template or several templates and not just a single query. This approach has an important impact on data arrangement performance and on queries performance, since this approach may help many more queries to be handled using less data arrangement objects.
摘要翻译：本发明是用于分析不同级别精度的查询模板的方法和系统。当本发明的系统决定排列数据时，使用这些模板，并且设计单个数据排列对象（HRBlob），其可以提供单个模板或多个模板，而不仅仅是单个查询。这种方法对数据排列性能和查询性能有重要的影响，因为这种方法可以帮助使用较少的数据排列对象来处理更多的查询。

4. 发明申请

US20110060753A1 METHODS FOR EFFECTIVE PROCESSING OF TIME SERIES 有权
标题翻译：时间序列有效处理方法
公开(公告)号：US20110060753A1
公开(公告)日：2011-03-10
申请号：US12753388
申请日：2010-04-02
申请人： Guy Shaked , Vladimir Braverman , Victor Belayaev , Gabby Rubin , Marine Sadetsky
发明人： Guy Shaked , Vladimir Braverman , Victor Belayaev , Gabby Rubin , Marine Sadetsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30551 , G06F17/30595 , G06F17/30598 , G06F17/30864
摘要： A method of effectively representing and processing data sets with time series is disclosed. The method may comprise representing time series as a virtual part of data in a data store layer of a user system, thereby allowing processing of time-series related queries in said data store layer of said user system.
摘要翻译：公开了一种以时间序列有效地表示和处理数据集的方法。该方法可以包括将时间序列表示为用户系统的数据存储层中的数据的虚拟部分，从而允许在所述用户系统的所述数据存储层中处理时间序列相关查询。

5. 发明授权

US09158822B2 System and method for pick-and-drop sampling 有权
标题翻译：抽样抽样的系统和方法
公开(公告)号：US09158822B2
公开(公告)日：2015-10-13
申请号：US13684402
申请日：2012-11-23
申请人： Vladimir Braverman , Rafail Ostrovsky
发明人： Vladimir Braverman , Rafail Ostrovsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30516 , G06F17/30536
摘要： A database system includes an input to a database server configured to deliver a data stream formed of a sequence of elements, D={p1, p2, . . . , pm} of size m of numbers from {1, . . . , n} to the database server. The system further includes a computer program that causes a processor to approximate frequency moments (Fk) in the data stream, such that a frequency of an element (i) is defined as fi=|{j:pj=i}| and a k-th frequency moment of D is defined as F k = ∑ i = 1 n ⁢ m i k ⁢ ⁢ in ⁢ ⁢ a single pass through the data stream. The processor is caused to carry out the steps of locating elements (i) with a frequency ΩFk in the data stream as heavy elements and approximating fi as ≧ a fraction of fi to limit memory resources used by the processor to estimate Fk to O(n1−2/k log(n)) bits.
摘要翻译：数据库系统包括对数据库服务器的输入，该数据库服务器被配置为传送由元素序列D = {p1，p2，...，。。，pm}的数字从{1，。。。，n}到数据库服务器。该系统进一步包括使处理器近似数据流中的频率矩（Fk）的计算机程序，使得元素（i）的频率被定义为fi = | {j：pj = i} | 并且D的第k个频率矩被定义为通过数据流的单次通过中的F k =Σi = 1 n m i k。导致处理器执行将元素（i）定位在数据流中的频率＆OHgr; Fk作为重要元素的步骤，并且将f i近似为≧等于f的一部分，以限制处理器使用的存储器资源来估计F k至O （n1-2 / klog（n））位。

6. 发明申请

US20140149364A1 SYSTEM AND METHOD FOR PICK-AND-DROP SAMPLING 有权
标题翻译：用于抽取和抽取抽样的系统和方法
公开(公告)号：US20140149364A1
公开(公告)日：2014-05-29
申请号：US13684402
申请日：2012-11-23
申请人： Vladimir Braverman , Rafail Ostrovsky
发明人： Vladimir Braverman , Rafail Ostrovsky
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30516 , G06F17/30536
摘要： A database system includes an input to a database server configured to deliver a data stream formed of a sequence of elements, D={p1, p2, . . . , pm} of size m of numbers from {1, . . . , n} to the database server. The system further includes a computer program that causes a processor to approximate frequency moments (Fk) in the data stream, such that a frequency of an element (i) is defined as fi=|{j:pj=i}| and a k-th frequency moment of D is defined as F k = ∑ i = 1 n  m i k   in   a single pass through the data stream. The processor is caused to carry out the steps of locating elements (i) with a frequency ΩFk in the data stream as heavy elements and approximating fi as ≧ a fraction of fi to limit memory resources used by the processor to estimate Fk to O(n1−2/k log(n)) bits.
摘要翻译：数据库系统包括对数据库服务器的输入，该数据库服务器被配置为传送由元素序列D = {p1，p2，...，。。，pm}的数字从{1，。。。，n}到数据库服务器。该系统还包括使处理器近似数据流中的频率矩（Fk）的计算机程序，使得元素（i）的频率被定义为f i = | {j：pj = i} | 并且D的第k个频率矩被定义为在通过数据流的单次传递中F k =Σi = 1 n。导致处理器执行将元素（i）定位在数据流中的频率＆OHgr; Fk作为重要元素的步骤，并且将f i近似为≧等于f的一部分，以限制处理器使用的存储器资源来估计F k至O （n1-2 / klog（n））位。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式