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

1. 发明申请

WO2009009754A2 SEMANTIC TRANSACTIONS IN ONLINE APPLICATIONS 审中-公开
标题翻译：在线应用程序的语义交易
公开(公告)号：WO2009009754A2
公开(公告)日：2009-01-15
申请号：PCT/US2008/069840
申请日：2008-07-11
申请人： CORNELL RESEARCH FOUNDATION, INC. , GEHRKE, Johannes , GUPTA, Nitin , UNTERBRUNNER, Philipp , DEMERS, Alan
发明人： GEHRKE, Johannes , GUPTA, Nitin , UNTERBRUNNER, Philipp , DEMERS, Alan
IPC分类号： G06F15/16 , G06F17/00
CPC分类号： G06F9/466 , G06F17/30351 , G06F17/30371
摘要： A system and method for enabling distributed transaction processing by moving all application logic away from the server and into the client by using an optimistic concurrency control framework with client-side transaction validation including virtual full replication under a transactional programming model with full Atomicity, Consistency, Isolation, and Durability (ACID) properties.
摘要翻译：通过使用具有客户端事务验证的开放式并发控制框架将所有应用程序逻辑从服务器移动到客户端中来实现分布式事务处理的系统和方法，所述客户端事务验证包括事务处理下的虚拟完全复制编程模型具有完整的原子性，一致性，隔离性和持久性（ACID）属性。

2. 发明申请

WO2011023652A2 CONTINUOUS FULL SCAN DATA STORE TABLE AND DISTRIBUTED DATA STORE FEATURING PREDICTABLE ANSWER TIME FOR UNPREDICTABLE WORKLOAD 审中-公开
标题翻译：连续全扫描数据存储表和分布式数据存储功能可预测的应答时间用于不可预测的工作
公开(公告)号：WO2011023652A2
公开(公告)日：2011-03-03
申请号：PCT/EP2010/062223
申请日：2010-08-23
申请人： AMADEUS S.A.S. , FAUSER, Dietmar , MEYER, Jeremy , FLORIMOND, Cédric , KOSSMANN, Donald , ALONSO, Gustavo , GIANNIKIS, Georgios , UNTERBRUNNER, Philipp
发明人： FAUSER, Dietmar , MEYER, Jeremy , FLORIMOND, Cédric , KOSSMANN, Donald , ALONSO, Gustavo , GIANNIKIS, Georgios , UNTERBRUNNER, Philipp
IPC分类号： G06F17/30
CPC分类号： G06F17/30203 , G06F17/30286 , G06F17/30545 , G06F17/30575
摘要： A method for storing and retrieving data in a storage node of a data store and storage node of a data store, storing in main-memory at least one segment of a relational table is described. The storage node comprises at least one computational core running at least one scan thread each dedicated to the scanning of one of the at least one segment. The storage node is characterized in that the at least one scan thread uniquely, continuously and exhaustively scans the dedicated segment of the relational table. The storage node receives and processes batches of query and update operations for the at least one segment of the relational table. The query and update operations of a batch are re-indexed at beginning of each scan by the scan thread. Then, the indexed query and update operations of a batch are independently joined to data records of said segment that match with predicates of the indexed query and update operations so that the indexed query and update operations of a batch are progressively fulfilled whenever joined data records are retrieved by the scan thread while scanning said segment. This allows maximizing the sharing and access of data records in main- memory between query and update operations of a batch.
摘要翻译：描述了一种用于在数据存储器的数据存储和存储节点的存储节点中存储和检索数据的方法，其在主存储器中存储关系表的至少一个段。存储节点包括运行至少一个扫描线的至少一个计算核心，每个扫描线程专用于扫描至少一个片段之一。所述存储节点的特征在于，所述至少一个扫描线程唯一地，持续地和彻底地扫描关系表的专用段。存储节点接收并处理关系表的至少一个段的查询和更新操作的批次。扫描线程在每次扫描开始时重新建立批次的查询和更新操作。然后，批次的索引查询和更新操作被独立地连接到与索引查询和更新操作的谓词相匹配的所述段的数据记录，使得当连接的数据记录是时，逐个满足批次的索引查询和更新操作在扫描所述段时由扫描线检索。这允许最大化在批处理的查询和更新操作之间的主内存中的数据记录的共享和访问。

3. 发明申请

WO2011023651A1 SEGMENTED MAIN-MEMORY STORED RELATIONAL DATABASE TABLE SYSTEM WITH IMPROVED COLLABORATIVE SCAN ALGORITHM 审中-公开
标题翻译：具有改进的协同扫描算法的SEGMENTED主存储存储关系数据库系统
公开(公告)号：WO2011023651A1
公开(公告)日：2011-03-03
申请号：PCT/EP2010/062221
申请日：2010-08-23
申请人： AMADEUS S.A.S. , FAUSER, Dietmar , MEYER, Jeremy , FLORIMOND, Cédric , KOSSMANN, Donald , ALONSO, Gustavo , GIANNIKIS, Georgios , UNTERBRUNNER, Philipp
发明人： FAUSER, Dietmar , MEYER, Jeremy , FLORIMOND, Cédric , KOSSMANN, Donald , ALONSO, Gustavo , GIANNIKIS, Georgios , UNTERBRUNNER, Philipp
IPC分类号： G06F17/30
CPC分类号： G06F17/30203 , G06F17/30286 , G06F17/30545 , G06F17/30575
摘要： In a computerized distributed environment a system is described that exhaustively scans at least one memory segment of a database relational table during successive continuous scanning cycles. The scanning system comprises a first and a second cursor adapted to exhaustively scan the one or more memory segments at each scanning cycle in order to process pending update and query database operations. The first cursor is a write cursor configured to write into the one or more memory segments and process database operations aimed at updating data records into the relational table. The second cursor is a read cursor configured to read out from the one or more memory segments relational table data records in response to a query. The scanning system is characterized in that the first cursor is further configured to write relational table data records into the one or more memory segments before the second cursor can read them, and in that the time delay between the first cursor writing and the second cursor reading is less than one scanning cycle. Query database operations are reordered to perform query-data joins. The database update operations include updating, deleting and inserting relational table data records. They are processed in their order of arrival. Also, query and update database operations are reordered to perform query/update-data joins.
摘要翻译：在计算机化的分布式环境中，描述了在连续的连续扫描周期期间彻底扫描数据库关系表的至少一个存储器段的系统。该扫描系统包括适于在每个扫描周期对所述一个或多个存储器段进行彻底扫描的第一和第二光标，以便处理待处理的更新和查询数据库操作。第一个光标是写入光标，用于写入一个或多个内存段，并处理旨在将数据记录更新到关系表中的数据库操作。第二光标是被配置为响应于查询从一个或多个存储器段关系表数据记录读出的读取游标。扫描系统的特征在于，第一光标还被配置为在第二光标可以读取它们之前将关系表数据记录写入一个或多个存储器段，并且在第一光标写入和第二光标读取之间的时间延迟不到一个扫描周期。查询数据库操作被重新排序以执行查询数据连接。数据库更新操作包括更新，删除和插入关系表数据记录。他们按照到达顺序进行处理。此外，查询和更新数据库操作被重新排序以执行查询/更新数据连接。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式