公开(公告)号：US20140280373A1

公开(公告)日：2014-09-18

申请号：US13842843

申请日：2013-03-15

Applicant: John Raitto ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang

Inventor： John Raitto ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang

IPC: G06F17/30

CPC classification number: G06F17/30292 ,  G06F17/30442 ,  G06F17/30463 ,  G06F17/30575

Abstract: A method, apparatus, and system for automatically determining an optimal database subsection is provided. A database subsection is selected to optimize certain benefits when the database subsection is translated, transferred, and cached on an alternative database system, which may utilize a different technology or database engine that provides certain performance benefits compared to the original database system. Algorithms such as multi-path greedy selection and/or dynamic programming may provide optimal or near-optimal results. A host for the alternative database server may be shared with or otherwise located in close physical proximity to improve latency for a database application or client layer. Once the database subsection analysis is completed, a report may be generated and presented to the user, and an implementation script may also be created to automatically configure a client host to function as a cache or replacement system according various cache size configurations described in the report.

Abstract translation: 提供了一种用于自动确定最佳数据库子部分的方法，装置和系统。 当数据库部分被翻译，传输和缓存在替代数据库系统上时，选择数据库子部分来优化某些优点，替代数据库系统可以利用与原始数据库系统相比提供某些性能优势的不同技术或数据库引擎。 诸如多路径贪心选择和/或动态规划的算法可以提供最佳或接近最佳的结果。 替代数据库服务器的主机可以与物理接近处于共享状态或以其他方式设置，以改善数据库应用程序或客户端层的延迟。 一旦完成了数据库子部分分析，就可以生成报告并呈现给用户，还可以创建实现脚本，以便根据报告中描述的各种缓存大小配置自动配置客户端主机作为缓存或替换系统。 。

公开(公告)号：US20080222159A1

公开(公告)日：2008-09-11

申请号：US12030094

申请日：2008-02-12

Applicant: Rohan Aranha ,  Paul Tuck ,  John Ernest Miller ,  Chih-Ping Wang ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

Inventor： Rohan Aranha ,  Paul Tuck ,  John Ernest Miller ,  Chih-Ping Wang ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

IPC: G06F17/30

CPC classification number: G06F17/30289

Abstract: A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails.

Abstract translation: 系统包括主动节点和备用节点以及零个或多个副本节点。 每个节点包括数据库系统，诸如内存中数据库系统。 应用于主动节点的客户端更新被写入备用节点，备用节点将更新写入主数据库，并更新副本节点。 提交票号在事务日志中标记条目，并且如果活动节点或备​​用节点中的任一个失败，则用于促进恢复。 应用于主数据库的更新将自动刷新到活动节点，并由主动节点写入到将更新传播到副本节点的备用节点。 书签用于跟踪主数据库的更新记录，并且如果主动节点或备​​用节点中的任一个失败，则用于促进恢复。

公开(公告)号：US08868504B2

公开(公告)日：2014-10-21

申请号：US12030094

申请日：2008-02-12

Applicant: Rohan Aranha ,  Paul Tuck ,  John Ernest Miller ,  Chih-Ping Wang ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

Inventor： Rohan Aranha ,  Paul Tuck ,  John Ernest Miller ,  Chih-Ping Wang ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

IPC: G06F17/30 ,  G06F17/00

CPC classification number: G06F17/30289

Abstract: A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails.

Abstract translation: 系统包括主动节点和备用节点以及零个或多个副本节点。 每个节点包括数据库系统，诸如内存中数据库系统。 应用于主动节点的客户端更新被写入到备用节点，备用节点将更新写入主数据库，并更新副本节点。 提交票号在事务日志中标记条目，并且如果活动节点或备​​用节点中的任一个失败，则用于促进恢复。 应用于主数据库的更新将自动刷新到活动节点，并由主动节点写入到将更新传播到副本节点的备用节点。 书签用于跟踪主数据库的更新记录，并且如果主动节点或备​​用节点中的任一个失败，则用于促进恢复。

公开(公告)号：US20110072217A1

公开(公告)日：2011-03-24

申请号：US12562928

申请日：2009-09-18

Applicant: Chi Hoang ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang ,  John Miller ,  Dilys Thomas ,  Nagender Bandi ,  Susan Cheng

Inventor： Chi Hoang ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang ,  John Miller ,  Dilys Thomas ,  Nagender Bandi ,  Susan Cheng

IPC: G06F12/08 ,  G06F12/00

CPC classification number: G06F17/30312 ,  G06F12/084

Abstract: A plurality of mid-tier databases form a single, consistent cache grid for data in a one or more backend data sources, such as a database system. The mid-tier databases may be standard relational databases. Cache agents at each mid-tier database swap in data from the backend database as needed. Consistency in the cache grid is maintained by ownership locks. Cache agents prevent database operations that will modify cached data in a mid-tier database unless and until ownership of the cached data can be acquired for the mid-tier database. Cache groups define what backend data may be cached, as well as a general structure in which the backend data is to be cached. Metadata for cache groups is shared to ensure that data is cached in the same form throughout the entire grid. Ownership of cached data can then be tracked through a mapping of cached instances of data to particular mid-tier databases.

Abstract translation: 多个中间层数据库形成用于一个或多个后端数据源（例如数据库系统）中的数据的单一，一致的高速缓存网格。 中间层数据库可以是标准关系数据库。 每个中间层数据库的缓存代理根据需要从后端数据库交换数据。 高速缓存网格中的一致性由所有权锁定维护。 高速缓存代理阻止数据库操作，将修改中间层数据库中的缓存数据，除非可以为中间层数据库获取缓存数据的所有权。 缓存组定义可以缓存哪些后端数据，以及要缓存后端数据的一般结构。 共享缓存组的元数据，以确保数据在整个网格中以相同的格式进行缓存。 然后可以通过将缓存的数据实例映射到特定中间层数据库来跟踪缓存数据的所有权。

公开(公告)号：US08738568B2

公开(公告)日：2014-05-27

申请号：US13101783

申请日：2011-05-05

Applicant: Sourav Ghosh ,  Rohan Aranha ,  Tirthankar Lahiri ,  Mark McAuliffe ,  Chih-Ping Wang ,  Paul Tuck ,  Nagender Bandi ,  John E. Miller ,  Dina Thomas ,  Marie-Anne Neimat

Inventor： Sourav Ghosh ,  Rohan Aranha ,  Tirthankar Lahiri ,  Mark McAuliffe ,  Chih-Ping Wang ,  Paul Tuck ,  Nagender Bandi ,  John E. Miller ,  Dina Thomas ,  Marie-Anne Neimat

IPC: G06F7/00

CPC classification number: G06F11/2038 ,  G06F11/2097 ,  G06F17/30575 ,  G06F17/30581 ,  G06F2201/80

Abstract: A replication track is a designated group of transactions that are to be replicated at a destination database in a way that, with respect to any other transaction in the replication track, preserves transactional dependency. Further, transactions in a replication track can be replicated at the destination database without regard to transactional dependency of other transactions in another track. This facilitates concurrent parallel replication of transactions of different tracks. Replicating data in this manner is referred to herein as track replication. An application may request execution of transactions and designate different tracks for transactions.

Abstract translation: 复制轨迹是要在目标数据库中复制的指定的一组事务，其方式是相对于复制轨道中的任何其他事务来保留事务依赖关系。 此外，可以在目标数据库中复制复制轨道中的事务，而不考虑另一轨道中其他事务的事务依赖关系。 这有助于同时并行复制不同轨道的事务。 以这种方式复制数据在本文称为轨道复制。 应用程序可以请求执行事务并为事务指定不同的轨道。

公开(公告)号：US6012059A

公开(公告)日：2000-01-04

申请号：US918686

申请日：1997-08-21

Applicant: Marie-Anne Neimat ,  Kurt Shoens ,  Oded Shmueli

Inventor： Marie-Anne Neimat ,  Kurt Shoens ,  Oded Shmueli

IPC: G06F17/30

CPC classification number: G06F17/30575 ,  Y10S707/99938 ,  Y10S707/99952

Abstract: Local transactions are run at replication sites while receiving and tracking replication packages from primary sites. If a package coming in from a primary site updates data that a local transaction used, the data is considered stale and the local transaction is restarted. When the replication site wishes to commit (e.g., update data at the primary sites), a special dummy marker is submitted and committed. The marker comprises a dummy transaction that updates a piece of data at the primary site private to the replication site. The local site waits for the dummy transaction in the stream of replication packages sent from the primary site. Once the dummy transaction is received, the replication site is assured that any subsequent replication packages from the primary site will not affect the local transaction. If the replication packages received before the marker do not affect data items referenced during the local transaction, the local transaction commits.

Abstract translation: 本地事务在复制站点上运行，同时从主站点接收和跟踪复制包。 如果从主站点进入的软件包更新了本地事务使用的数据，那么数据将被视为过时且本地事务重新启动。 当复制站点希望提交（例如，在主站点更新数据）时，提交并提交特殊的虚拟标记。 该标记包括一个虚拟事务，它将复制站点的主站点私有的一段数据更新。 本地站点等待从主站点发送的复制包流中的虚拟事务。 一旦接收到虚拟事务，复制站点就可以确保来自主站点的任何后续复制包不会影响本地事务。 如果在标记之前收到的复制包不会影响在本地事务期间引用的数据项，则本地事务提交。

公开(公告)号：US5542087A

公开(公告)日：1996-07-30

申请号：US137871

申请日：1993-10-15

Applicant: Marie-Anne Neimat ,  Donovan Schnelder ,  Witold Litwin

Inventor： Marie-Anne Neimat ,  Donovan Schnelder ,  Witold Litwin

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30949

Abstract: A data processing method and apparatus, which generate a correct memory address from a character or digit string such as a record key value, and which is adapted for use in distributed or parallel processing architectures such as computer networks, multiprocessing systems, and the like. The invention provides a plurality of client data processors and a plurality of file servers, each server including at least a respective one memory location or "bucket". The method of the invention includes the following steps: generating the key value by means of any one of the client data processors; generating a first memory address from the key value, the first address identifying a first memory location; selecting from the plurality of servers a server that includes the first memory location; transmitting the key value from the one client to the server that includes the first memory location; and determining whether the first address is the correct address by means of the server. The method of the invention further provides that if the first address is not the correct address then the following steps are performed: generating a second memory address from the key value by means of the server, the second address identifying a second memory location; selecting from the plurality of servers another server, which includes the second memory location; transmitting the key value from the server that includes the first memory location to the other server, which includes the second memory location; determining whether the second address is the correct address by means of the other server; and generating a third memory address, which is the correct address, if neither the first or second addresses is the correct address. The present invention provides fast storage and subsequent searching and retrieval of data records in data processing applications such as database applications.

Abstract translation: 一种数据处理方法和装置，其从诸如记录密钥值的字符或数字串生成正确的存储器地址，并且适用于分布式或并行处理架构，例如计算机网络，多处理系统等。 本发明提供了多个客户端数据处理器和多个文件服务器，每个服务器至少包括相应的一个存储器位置或“桶”。 本发明的方法包括以下步骤：通过任何一个客户端数据处理器产生密钥值; 从所述键值生成第一存储器地址，所述第一地址识别第一存储器位置; 从所述多个服务器中选择包括所述第一存储器位置的服务器; 将所述密钥值从所述一个客户端发送到包括所述第一存储器位置的所述服务器; 以及通过所述服务器确定所述第一地址是否是正确的地址。 本发明的方法还提供了如果第一地址不是正确的地址，则执行以下步骤：通过服务器从密钥值生成第二存储器地址，第二地址标识第二存储器位置; 从所述多个服务器中选择包括所述第二存储器位置的另一个服务器; 将包括所述第一存储器位置的所述服务器的所述密钥值发送到包括所述第二存储器位置的所述其他服务器; 通过其他服务器确定第二个地址是否是正确的地址; 并且如果第一或第二地址都不是正确的地址，则生成第三存储器地址，其是正确的地址。 本发明提供了诸如数据库应用的数据处理应用中的数据记录的快速存储和随后的搜索和检索。

公开(公告)号：US10756759B2

公开(公告)日：2020-08-25

申请号：US13224327

申请日：2011-09-02

Applicant: Tirthankar Lahiri ,  Chi-Kim Hoang ,  Dina Thomas ,  Kirk Meredith Edson ,  Subhradyuti Sarkar ,  Mark McAuliffe ,  Marie-Anne Neimat ,  Chih-Ping Wang

Inventor： Tirthankar Lahiri ,  Chi-Kim Hoang ,  Dina Thomas ,  Kirk Meredith Edson ,  Subhradyuti Sarkar ,  Mark McAuliffe ,  Marie-Anne Neimat ,  Chih-Ping Wang

IPC: H03M7/42 ,  H03M7/30 ,  G06F16/22

Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

公开(公告)号：US08401994B2

公开(公告)日：2013-03-19

申请号：US12562928

申请日：2009-09-18

Applicant: Chi Hoang ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang ,  John Miller ,  Dilys Thomas ,  Nagender Bandi ,  Susan Cheng

Inventor： Chi Hoang ,  Tirthankar Lahiri ,  Marie-Anne Neimat ,  Chih-Ping Wang ,  John Miller ,  Dilys Thomas ,  Nagender Bandi ,  Susan Cheng

IPC: G06F17/00

CPC classification number: G06F17/30312 ,  G06F12/084

Abstract: A plurality of mid-tier databases form a single, consistent cache grid for data in a one or more backend data sources, such as a database system. The mid-tier databases may be standard relational databases. Cache agents at each mid-tier database swap in data from the backend database as needed. Consistency in the cache grid is maintained by ownership locks. Cache agents prevent database operations that will modify cached data in a mid-tier database unless and until ownership of the cached data can be acquired for the mid-tier database. Cache groups define what backend data may be cached, as well as a general structure in which the backend data is to be cached. Metadata for cache groups is shared to ensure that data is cached in the same form throughout the entire grid. Ownership of cached data can then be tracked through a mapping of cached instances of data to particular mid-tier databases.

Abstract translation: 多个中间层数据库形成用于一个或多个后端数据源（例如数据库系统）中的数据的单一，一致的高速缓存网格。 中间层数据库可以是标准关系数据库。 每个中间层数据库的缓存代理根据需要从后端数据库交换数据。 高速缓存网格中的一致性由所有权锁定维护。 高速缓存代理阻止数据库操作，将修改中间层数据库中的缓存数据，除非可以为中间层数据库获取缓存数据的所有权。 缓存组定义可以缓存哪些后端数据，以及要缓存后端数据的一般结构。 共享缓存组的元数据，以确保数据在整个网格中以相同的格式缓存。 然后可以通过将缓存的数据实例映射到特定中间层数据库来跟踪缓存数据的所有权。

公开(公告)号：US20080222111A1

公开(公告)日：2008-09-11

申请号：US12030113

申请日：2008-02-12

Applicant: Chi Kim Hoang ,  Chih-Ping Wang ,  John Ernest Miller ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

Inventor： Chi Kim Hoang ,  Chih-Ping Wang ,  John Ernest Miller ,  Marie-Anne Neimat ,  Susan Sokeng Cheung

IPC: G06F7/06

CPC classification number: G06F16/21

Abstract: A fully transactional mid-tier database system services database transactions. A cache manager dynamically loads database entries from a fully transactional backend-tier database system into the mid-tier database system according to the received database transactions. Time based aging or usage based aging can be assigned to selected tables in the mid-tier database system. Database entries contained in the selected tables are then automatically removed according to assigned aging constraints.

Abstract translation: 完全事务中层数据库系统服务数据库事务。 高速缓存管理器根据接收的数据库事务，将数据库条目从完全事务后端数据库系统动态加载到中间层数据库系统中。 基于时间的老化或基于使用的老化可以分配给中间层数据库系统中的选定表。 然后根据分配的老化约束自动删除选定表中包含的数据库条目。