公开(公告)号：US09223805B2

公开(公告)日：2015-12-29

申请号：US13754301

申请日：2013-01-30

申请人： Alex Skidanov ,  Marko Tintor ,  Adam Prout

发明人： Alex Skidanov ,  Marko Tintor ,  Adam Prout

IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F11/14

CPC分类号： G06F17/30289 ,  G06F11/1446 ,  G06F11/1471 ,  G06F2201/80 ,  G06F2201/84

摘要： A database durability implementation records only committed transactions in a log file. A pair of log files and a pair of snapshot files are maintained. When a snapshot of the database is completed, the ‘current’ log becomes the ‘prior’ log and the other log becomes the ‘current’ log. After the next snapshot is completed, the prior log and prior snapshot may be deleted. Transactions that are not committed are not recorded in the current log, thereby avoiding the need to undo aborted transactions. If a given change is reflected in a completed snapshot, it does not appear in either of the logs; if the change is not yet reflected in a completed snapshot, it is guaranteed to be stored in one of the logs. During recovery, the system assesses both snapshots. The most recent of the completed snapshots is used, and the corresponding log(s) is (are) applied.

摘要翻译： 数据库耐久性实现只记录日志文件中提交的事务。 一对日志文件和一对快照文件被维护。 当数据库的快照完成时，“当前”日志成为“先前”日志，其他日志成为“当前”日志。 下一个快照完成后，先前的日志和先前的快照可能会被删除。 未提交的事务不会记录在当前日志中，从而避免了撤消中止事务的需要。 如果给定的更改反映在完成的快照中，则它不会显示在任一日志中; 如果更改尚未反映在完成的快照中，则保证将其存储在其中一个日志中。 在恢复期间，系统会评估两个快照。 最近使用完成的快照，并应用相应的日志。

公开(公告)号：US20130198139A1

公开(公告)日：2013-08-01

申请号：US13754301

申请日：2013-01-30

申请人： Alex SKIDANOV ,  Marko Tintor ,  Adam Prout

发明人： Alex SKIDANOV ,  Marko Tintor ,  Adam Prout

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  G06F11/1446 ,  G06F11/1471 ,  G06F2201/80 ,  G06F2201/84

摘要： A database durability implementation records only committed transactions in a log file. A pair of log files and a pair of snapshot files are maintained. When a snapshot of the database is completed, the ‘current’ log becomes the ‘prior’ log and the other log becomes the ‘current’ log. After the next snapshot is completed, the prior log and prior snapshot may be deleted. Transactions that are not committed are not recorded in the current log, thereby avoiding the need to undo aborted transactions. If a given change is reflected in a completed snapshot, it does not appear in either of the logs; if the change is not yet reflected in a completed snapshot, it is guaranteed to be stored in one of the logs. During recovery, the system assesses both snapshots. The most recent of the completed snapshots is used, and the corresponding log(s) is (are) applied.

摘要翻译： 数据库耐久性实现只记录日志文件中提交的事务。 一对日志文件和一对快照文件被维护。 当数据库的快照完成时，“当前”日志成为“先前”日志，其他日志成为“当前”日志。 下一个快照完成后，先前的日志和先前的快照可能会被删除。 未提交的事务不会记录在当前日志中，从而避免了撤消中止事务的需要。 如果给定的更改反映在完成的快照中，则它不会显示在任一日志中; 如果更改尚未反映在完成的快照中，则保证将其存储在其中一个日志中。 在恢复期间，系统会评估两个快照。 最近使用完成的快照，并应用相应的日志。

公开(公告)号：US09317552B2

公开(公告)日：2016-04-19

申请号：US13754333

申请日：2013-01-30

申请人： Adam Prout ,  Marko Tintor ,  Alex Skidanov

发明人： Adam Prout ,  Marko Tintor ,  Alex Skidanov

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30442 ,  G06F17/30433

摘要： A system and method for executing query plans preprocesses a user's queries to identify and extract select parameters of the query, creates a skeletal query with reference to the extracted parameters, creates and compiles an executable version of the skeletal query, then executes the compiled version of the skeletal query using the particular parameters in the current query. The compiled version of the parameterized skeletal query is stored, and when another query is submitted that matches the skeletal query (but with potentially different parameters), the previously compiled skeleton query is executed with the parameters of this latter query.

摘要翻译： 用于执行查询计划的系统和方法预处理用户的查询以识别和提取查询的选择参数，参考提取的参数创建骨架查询，创建和编译骨架查询的可执行版本，然后执行编译版本 使用当前查询中的特定参数的骨架查询。 存储参数化骨架查询的编译版本，并且当提交与骨架查询匹配（但具有潜在不同参数）的另一个查询时，先前编译的框架查询将使用后一查询的参数执行。

公开(公告)号：US08478740B2

公开(公告)日：2013-07-02

申请号：US12970650

申请日：2010-12-16

申请人： Sorin Gherman ,  Kunal Mukerjee ,  Adam Prout

发明人： Sorin Gherman ,  Kunal Mukerjee ,  Adam Prout

IPC分类号： G06F17/30

CPC分类号： G06F17/30011 ,  G06F17/30017 ,  G06F17/3002 ,  G06F17/30705

摘要： The present invention extends to methods, systems, and computer program products for deriving document similarity indices. Embodiments of the invention include scalable and efficient mechanisms for deriving and updating a document similarity index for a plurality of documents. The number of maintained similarities can be controlled to conserve CPU and storage resources.

摘要翻译： 本发明扩展到用于导出文档相似性指标的方法，系统和计算机程序产品。 本发明的实施例包括用于导出和更新多个文档的文档相似性索引的可扩展和有效的机制。 可以控制维护的相似性数量以节省CPU和存储资源。

公开(公告)号：US20120246411A1

公开(公告)日：2012-09-27

申请号：US13053171

申请日：2011-03-21

申请人： Adrian Birka ,  Adam Prout ,  Sangeetha Shekar ,  Georgiy I. Reynya

发明人： Adrian Birka ,  Adam Prout ,  Sangeetha Shekar ,  Georgiy I. Reynya

IPC分类号： G06F12/08

CPC分类号： G06F12/121 ,  G06F2212/163

摘要： Embodiments are directed to efficiently determining which cache entries are to be evicted from memory and to incorporating a probability of reuse estimation in a cache entry eviction determination. A computer system with multiple different caches accesses a cache entry. The computer system determines an entry cost value for the accessed cache entry. The entry cost value indicates an amount of time the computer system is slowed down by to load the cache entry into cache memory. The computer system determines an opportunity cost value for the computing system caches. The opportunity cost value indicates an amount of time by which the computer system is slowed down while performing other operations that could have used the cache entry's cache memory space. Upon determining that the entry cost value is lower than the opportunity cost value, the computer system probabilistically evicts the cache entry from cache memory.

摘要翻译： 实施例旨在有效地确定哪些高速缓存条目将被从存储器驱逐出来并且将重用估计的概率并入高速缓存条目驱逐确定中。 具有多个不同缓存的计算机系统访问高速缓存条目。 计算机系统确定所访问的高速缓存条目的入口成本值。 输入成本值表示将缓存条目加载到高速缓冲存储器中的计算机系统减速的时间量。 计算机系统确定计算系统高速缓存的机会成本值。 机会成本值表示在执行可能已经使用高速缓存条目的高速缓冲存储器空间的其他操作时计算机系统减速的时间量。 在确定入口成本值低于机会成本值时，计算机系统概率地将高速缓存条目从缓存存储器中排除。

公开(公告)号：US20120158731A1

公开(公告)日：2012-06-21

申请号：US12970650

申请日：2010-12-16

申请人： Sorin Gherman ,  Kunal Mukerjee ,  Adam Prout

发明人： Sorin Gherman ,  Kunal Mukerjee ,  Adam Prout

IPC分类号： G06F17/30

CPC分类号： G06F17/30011 ,  G06F17/30017 ,  G06F17/3002 ,  G06F17/30705

摘要： The present invention extends to methods, systems, and computer program products for deriving document similarity indices. Embodiments of the invention include scalable and efficient mechanisms for deriving and updating a document similarity index for a plurality of documents. The number of maintained similarities can be controlled to conserve CPU and storage resources.

摘要翻译： 本发明扩展到用于导出文档相似性指标的方法，系统和计算机程序产品。 本发明的实施例包括用于导出和更新多个文档的文档相似性索引的可扩展和有效的机制。 可以控制维护的相似性数量以节省CPU和存储资源。

公开(公告)号：US08402223B2

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

申请号：US13053171

申请日：2011-03-21

申请人： Adrian Birka ,  Adam Prout ,  Sangeetha Shekar ,  Georgiy I. Reynya

发明人： Adrian Birka ,  Adam Prout ,  Sangeetha Shekar ,  Georgiy I. Reynya

IPC分类号： G06F12/00

CPC分类号： G06F12/121 ,  G06F2212/163

摘要： Embodiments are directed to efficiently determining which cache entries are to be evicted from memory and to incorporating a probability of reuse estimation in a cache entry eviction determination. A computer system with multiple different caches accesses a cache entry. The computer system determines an entry cost value for the accessed cache entry. The entry cost value indicates an amount of time the computer system is slowed down by to load the cache entry into cache memory. The computer system determines an opportunity cost value for the computing system caches. The opportunity cost value indicates an amount of time by which the computer system is slowed down while performing other operations that could have used the cache entry's cache memory space. Upon determining that the entry cost value is lower than the opportunity cost value, the computer system probabilistically evicts the cache entry from cache memory.

摘要翻译： 实施例旨在有效地确定哪些高速缓存条目将被从存储器驱逐出来并且将重用估计的概率并入高速缓存条目驱逐确定中。 具有多个不同缓存的计算机系统访问高速缓存条目。 计算机系统确定所访问的高速缓存条目的入口成本值。 输入成本值表示将缓存条目加载到高速缓冲存储器中的计算机系统减速的时间量。 计算机系统确定计算系统高速缓存的机会成本值。 机会成本值表示在执行可能已经使用高速缓存条目的高速缓冲存储器空间的其他操作时计算机系统减速的时间量。 在确定入口成本值低于机会成本值时，计算机系统概率地将高速缓存条目从缓存存储器中排除。