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

1. 发明申请

WO2010080591A2 METHODS AND APPARATUS FOR CONTENT-AWARE DATA PARTITIONING AND DATA DE-DUPLICATION 审中-公开
标题翻译：用于内容数据分类和数据去重复的方法和装置
公开(公告)号：WO2010080591A2
公开(公告)日：2010-07-15
申请号：PCT/US2009/068687
申请日：2009-12-18
申请人： SUMOOH INC. , JAIN, Sanjay , CHAUDHRY, Puneesh
发明人： JAIN, Sanjay , CHAUDHRY, Puneesh
IPC分类号： G06F21/24 , G06F21/00 , G06F15/16 , G06F9/06
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F17/30156 , Y10S707/968 , Y10S707/969 , Y10S707/97 , Y10S707/971 , Y10S707/972 , Y10S707/973 , Y10S707/974
摘要： The systems and methods partition digital data units in a content aware fashion without relying on any ancestry information, which enables one to find duplicate chunks in unrelated units of digital data even across millions of documents spread across thousands of computer systems.
摘要翻译：系统和方法以内容感知方式分割数字数据单元，而不依赖于任何祖先信息，这使得能够在数千个数字数据的无关单元中找到重复的块，甚至跨数千个计算机系统传播的数百万个文档。

2. 发明申请

WO2005010650A2 METHOD AND SYSTEM FOR MANAGING DATA TRANSACTION REQUESTS 审中-公开
标题翻译：用于管理数据交易请求的方法和系统
公开(公告)号：WO2005010650A2
公开(公告)日：2005-02-03
申请号：PCT/US2004/014997
申请日：2004-05-12
申请人： EBAY INC. , GROSSFELD, Elena , WIDJOJO, Surjatini , LOCKERT, Thorsten , SEITZ, Greg , BARRESE, James , WIGGINTON, Randy , KASTEN, Chris
发明人： GROSSFELD, Elena , WIDJOJO, Surjatini , LOCKERT, Thorsten , SEITZ, Greg , BARRESE, James , WIGGINTON, Randy , KASTEN, Chris
IPC分类号： G06F
CPC分类号： G06F17/30371 , G06F9/505 , Y10S707/966 , Y10S707/968 , Y10S707/969
摘要： A method and system is provided to process data transactions in a data store including a plurality of databases. The system may comprise a computer interface module to receive a data transaction request from at least one requesting computer and a data store interface module to interface the system to the plurality of databases. The system also includes a data access layer defining an abstraction layer to identify at least one database of the plurality of databases. The data transaction request may be an object orientated request and the plurality of databases may be horizontally distributed wherein the data access layer defines an object orientated abstraction layer between the computer interface module and the plurality of databases. In one embodiment a data dependent routing module is provided that generates a query to a database that is identified based on content of the data in the data transaction request.
摘要翻译：提供了一种方法和系统，用于处理包括多个数据库的数据存储中的数据事务。该系统可以包括计算机接口模块，用于接收来自至少一个请求计算机的数据交易请求和数据存储接口模块以将系统接口到多个数据库。该系统还包括定义抽象层以识别多个数据库中的至少一个数据库的数据访问层。数据交易请求可以是面向对象的请求，并且多个数据库可以是水平分布的，其中数据访问层定义计算机接口模块和多个数据库之间的面向对象的抽象层。在一个实施例中，提供了一种数据相关路由模块，其对基于数据交易请求中的数据的内容所标识的数据库生成查询。

3. 发明申请

WO0068842A9 NAVIGATING DATA POINTS IN A MULTIDIMENSIONAL DATABASE 审中-公开
标题翻译：导航数据点在多维数据库
公开(公告)号：WO0068842A9
公开(公告)日：2001-11-22
申请号：PCT/US0013163
申请日：2000-05-12
申请人： PROCLARITY CORP
发明人： LOKKEN ROBERT L
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30395 , G06F17/30398 , G06F17/30572 , Y10S707/957 , Y10S707/968 , Y10S707/99933
摘要： A method and apparatus for forming a decomposition tree and using the decomposition tree for navigating through the data points in a multidimensional database. The data point tree is displayed for one of the dimensions of the multidimensional database with an icon representing a parent data point. The parent data point is then selected (2856), and a query (2868) is run to extract child data points under the parent data point (2870). Then the retrieved data points are displayed (2874) with the relationships between data points illustrated (2876). After the child data points are displayed further processing may be preformed such as selecting a new parent data point, grouping children, or displaying one of the values contained at the data points.
摘要翻译：一种用于形成分解树并使用分解树来导航多维数据库中的数据点的方法和装置。数据点树被显示为具有表示父数据点的图标的多维数据库的维度之一。然后选择父数据点（2856），并运行查询（2868）以提取父数据点（2870）下的子数据点。然后，显示检索到的数据点（2874）与所说明的数据点之间的关系（2876）。在显示子数据点之后，可以进行进一步的处理，例如选择新的父数据点，分组孩子或显示数据点中包含的值之一。

4. 发明申请

WO2010080591A3 METHODS AND APPARATUS FOR CONTENT-AWARE DATA PARTITIONING AND DATA DE-DUPLICATION 审中-公开
标题翻译：用于内容感知数据分割和数据去冗余的方法和设备
公开(公告)号：WO2010080591A3
公开(公告)日：2010-09-30
申请号：PCT/US2009068687
申请日：2009-12-18
申请人： SUMOOH INC , JAIN SANJAY , CHAUDHRY PUNEESH
发明人： JAIN SANJAY , CHAUDHRY PUNEESH
IPC分类号： G06F21/24 , G06F9/06 , G06F15/16 , G06F21/00
CPC分类号： G06F3/0641 , G06F3/0608 , G06F3/067 , G06F17/30156 , Y10S707/968 , Y10S707/969 , Y10S707/97 , Y10S707/971 , Y10S707/972 , Y10S707/973 , Y10S707/974
摘要： The systems and methods partition digital data units in a content aware fashion without relying on any ancestry information, which enables one to find duplicate chunks in unrelated units of digital data even across millions of documents spread across thousands of computer systems.
摘要翻译：该系统和方法以内容感知的方式划分数字数据单元而不依赖于任何祖先信息，这使得人们能够在数以千计的计算机系统上传播的数百万文件中以不相关的数字数据单元找到重复的块。

5. 发明申请

WO00068842A1 NAVIGATING DATA POINTS IN A MULTIDIMENSIONAL DATABASE 审中-公开
标题翻译：导航数据点在多维数据库
公开(公告)号：WO00068842A1
公开(公告)日：2000-11-16
申请号：PCT/US2000/013163
申请日：2000-05-12
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30395 , G06F17/30398 , G06F17/30572 , Y10S707/957 , Y10S707/968 , Y10S707/99933
摘要： A method and apparatus for forming a decomposition tree and using the decomposition tree for navigating through the data points in a multidimensional database. The data point tree is displayed for one of the dimensions of the multidimensional database with an icon representing a parent data point. The parent data point is then selected (2856), and a query (2868) is run to extract child data points under the parent data point (2870). Then the retrieved data points are displayed (2874) with the relationships between data points illustrated (2876). After the child data points are displayed further processing may be preformed such as selecting a new parent data point, grouping children, or displaying one of the values contained at the data points.
摘要翻译：一种用于形成分解树并使用分解树来导航多维数据库中的数据点的方法和装置。数据点树被显示为具有表示父数据点的图标的多维数据库的维度之一。然后选择父数据点（2856），并运行查询（2868）以提取父数据点（2870）下的子数据点。然后，显示检索到的数据点（2874）与所说明的数据点之间的关系（2876）。在显示子数据点之后，可以执行进一步的处理，例如选择新的父数据点，分组孩子或显示数据点中包含的值之一。

6. 发明申请

WO1995006292A1 METHOD AND APPARATUS FOR THE MODELING AND QUERY OF DATABASE STRUCTURES USING NATURAL LANGUAGE-LIKE CONSTRUCTS 审中-公开
标题翻译：使用自然语言结构对数据库结构进行建模和查询的方法和装置
公开(公告)号：WO1995006292A1
公开(公告)日：1995-03-02
申请号：PCT/US1994009658
申请日：1994-08-24
申请人： ASYMETRIX CORPORATION
发明人： ASYMETRIX CORPORATION , HARDING, James, Allan , McCORMACK, Jonathan, Ian
IPC分类号： G06F17/30
CPC分类号： G06F17/30398 , G06F17/30392 , G06F17/30401 , G06F17/30436 , Y10S707/917 , Y10S707/968 , Y10S707/99931 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99943
摘要： Computerized tools for modeling database designs and specifying queries of the data contained therein. Once it is determined that an information system needs to be created, the Fact Complier (100) of the present invention is invoked to create it. After creating the information system, the user creates a fact-tree, using the Fact &cir& _Tree &cir& _Specification Module (300), as a prelude to generating queries to the system. After creating the fact-tree, the user verifies that it is correct, using the Tree Interpreter, invoked as Fact &cir& _Tree &cir& _to &cir& _Description Module (500), of the present invention. Once the fact-tree has been verified, the Query Mapper of the present invention, invoked as Fact &cir& _Tree &cir& _to &cir& _SQL &cir& _Query Module (400), is used to generate information system queries.
摘要翻译：用于建模数据库设计和指定其中包含的数据的查询的计算机化工具。一旦确定需要创建信息系统，则调用本发明的事实协调器（100）来创建它。创建信息系统后，用户使用Fact＆cir＆_Tree＆cir＆_Specification Module（300）创建一个事实树，作为向系统生成查询的前奏。在创建事实树之后，用户使用树解释器验证其是正确的，该树解释器被调用为本发明的事实＆cir＆_Tree＆cir＆_to＆cir＆_描述模块（500）。一旦已经验证了事实树，本发明的查询映射器被用作事实和技术＆Cir＆_to＆cir＆_SQL＆cir＆_Query Module（400），用于生成信息系统查询。

7. 发明申请

WO1995002222A1 DATABASE STRUCTURES 审中-公开
标题翻译：数据库结构
公开(公告)号：WO1995002222A1
公开(公告)日：1995-01-19
申请号：PCT/EP1994002166
申请日：1994-07-01
申请人： EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE GMBH , FREESTON, Michael, William
发明人： EUROPEAN COMPUTER-INDUSTRY RESEARCH CENTRE GMBH
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/956 , Y10S707/968 , Y10S707/99931 , Y10S707/99942
摘要： A hierarchical index structure, for a multi-dimensional information database, is such that at least one index entry partition (d) may be disposed at a higher index tree level than the hierarchical level to which it corresponds. This change of level (promotion) occurs when a data distribution changes or the pattern of insertions/deletions is very skewed to particular areas of the dataspace. Whilst this makes the index tree unbalanced, it facilitates the addition of information to and the searching of such a database.
摘要翻译：用于多维信息数据库的层次索引结构使得至少一个索引条目分区（d）可以被布置在比它对应的分层级别更高的索引树级别。当数据分发发生变化或插入/删除模式非常偏斜到数据空间的特定区域时，会发生这种级别（升级）的更改。尽管这样使得索引树不平衡，它有助于向这种数据库添加信息和搜索。

8. 发明申请

WO2013003443A2 SYSTEM AND METHOD FOR IMPLEMENTING A SCALABLE DATA STORAGE SERVICE 审中-公开
标题翻译：实现可扩展数据存储服务的系统和方法
公开(公告)号：WO2013003443A2
公开(公告)日：2013-01-03
申请号：PCT/US2012/044371
申请日：2012-06-27
申请人： AMAZON TECHNOLOGIES, INC. , SIVASUBRAMANIAN, Swaminathan , STEFANI, Stefano , BURAGOHAIN, Chiranjeeb , BLACKMAN, Rande, A. , RATH, Timothy, Andrew , BRADFORD, Raymond, S. , MCALISTER, Grant, A., M. , KULESZA, Jakub , HAMILTON, James , CABRERA, Luis, Felipe
发明人： SIVASUBRAMANIAN, Swaminathan , STEFANI, Stefano , BURAGOHAIN, Chiranjeeb , BLACKMAN, Rande, A. , RATH, Timothy, Andrew , BRADFORD, Raymond, S. , MCALISTER, Grant, A., M. , KULESZA, Jakub , HAMILTON, James , CABRERA, Luis, Felipe
IPC分类号： G06F17/30
CPC分类号： G06F17/30584 , G06F9/5061 , G06F12/0848 , G06F17/30286 , G06F17/30289 , G06F17/30303 , G06F17/30306 , G06F17/30321 , G06F17/30339 , G06F17/3056 , H04L67/02 , H04L67/1097 , H04L67/2804 , Y10S707/968 , Y10S707/972
摘要： A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.
摘要翻译：实现可扩展数据存储服务的系统可以代表客户端在非关系数据存储中维护表。系统可以提供接收服务请求的Web服务接口，以及可用于请求创建，删除或描述表的API; 存储，检索，删除或修改其属性的项目; 或者查询（或扫描）已过滤的项目和/或返回的属性。可以调用异步工作流来创建或删除表。存储在表中的项目可以使用简单或复合主键进行分区和索引。系统可能不会对表大小强加预定义的限制，并且可以采用灵活的模式。该服务可以提供尽力而为或者承诺的吞吐量模型。响应于检测到工作负载变化，节点故障或其他条件或异常，系统可以自动缩放和/或重新分区表。

9. 发明申请

WO0106412A8 SYSTEM FOR DATABASE CREATION, MAINTENANCE AND ACCESS USING EVENT MARKING AND TWO-DIMENSIONAL PARTITIONING 审中-公开
标题翻译：使用事件标记和二维分区进行数据库创建，维护和访问的系统
公开(公告)号：WO0106412A8
公开(公告)日：2001-05-25
申请号：PCT/US9916768
申请日：1999-07-26
申请人： AMERICAN MAN SYS INC , MOULIN ALEXANDER
发明人： MOULIN ALEXANDER
IPC分类号： G06F17/30 , G06Q20/10 , G06Q30/04 , G06F17/60
CPC分类号： G06Q30/04 , G06F17/30 , G06Q20/102 , Y10S707/957 , Y10S707/968 , Y10S707/99943 , Y10S707/99953
摘要： A system and method that reduces access, backup, restore and processing time required by partitioning data in a database into two dimensions. The first dimension is by event processing date and the second dimension is by partition group. Once partitioned in two dimensions the data is stored in two-dimensional partitions in the form of rolling tables including an event marker. This partitioning and marking is done upon receipt of data which eliminates the need for further processing to efficiently store data. This partioning and marking further reduces the size of data blocks that need to be handled when backing up or restoring data, deleting data, and retrieving data. Thus, extremely large volumes of data can be handled in an efficient number.
摘要翻译：一种通过将数据库中的数据分成二维来减少访问，备份，恢复和处理所需时间的系统和方法。第一个维度是事件处理日期，第二个维度是按分区组。一旦二维分割，数据以滚动表的形式存储在二维分区中，包括事件标记。这种划分和标记是在接收到数据后完成的，这些数据无需进一步处理以有效地存储数据。这种分割和标记进一步减少了在备份或恢复数据，删除数据和检索数据时需要处理的数据块的大小。因此，可以以有效的数量处理非常大量的数据。

10. 发明申请

WO9933003B1 METHODS AND APPARATUS FOR EFFICIENTLY SPLITTING QUERY EXECUTION ACROSS CLIENT AND SERVER IN AN OBJECT-RELATIONAL MAPPING 审中-公开
标题翻译：方法和设备有效分析客户端和服务器之间的查询执行对象映射
公开(公告)号：WO9933003B1
公开(公告)日：1999-09-16
申请号：PCT/US9827244
申请日：1998-12-21
申请人： DEMICHIEL LINDA G , CATTELL RODERIC G G
发明人： DEMICHIEL LINDA G , CATTELL RODERIC G G
IPC分类号： G06F9/44 , G06F12/00 , G06F17/30
CPC分类号： G06F17/30607 , G06F17/30351 , G06F17/30362 , G06F17/30477 , Y10S707/955 , Y10S707/968 , Y10S707/99932 , Y10S707/99933 , Y10S707/99944
摘要： A process receives an object-based query and creates a logical tree that contains nodes representing operations that are required for the query to be completed. Operations that can be performed by an RDBMS are transmitted to the RDBMS as an SQL query. The RDBMS executes the SQL query and returns data to the process. The process places the data into appropriate fields of one or more objects, and stores the resulting objects in a memory, such as an object cache. The process executes the remaining node operations (that could not be performed by the RDBMS) in conjunction with the objects stored in the object cache, and forwards the results to a user program.
摘要翻译：进程接收基于对象的查询，并创建一个逻辑树，其中包含表示要完成查询所需的操作的节点。可以由RDBMS执行的操作作为SQL查询传输到RDBMS。 RDBMS执行SQL查询并将数据返回给进程。该过程将数据放入一个或多个对象的相应字段中，并将生成的对象存储在诸如对象缓存之类的存储器中。该进程结合存储在对象缓存中的对象执行剩余的节点操作（不能由RDBMS执行），并将结果转发给用户程序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式