公开(公告)号：US09710510B2

公开(公告)日：2017-07-18

申请号：US14200435

申请日：2014-03-07

Applicant: MongoDB, Inc.

Inventor： Dwight Merriman ,  Eliot Horowitz

IPC: G06F17/30 ,  G06F12/08 ,  G06F11/20

CPC classification number: G06F17/30362 ,  G06F11/2094 ,  G06F12/08 ,  G06F17/30377 ,  G06F17/30575 ,  G06F2201/80 ,  G06F2201/825

Abstract: According to one aspect, provided are methods and systems for minimizing lock contention in a distributed database environment. The methods and systems can include a database management component configured to manage database instances, the database management component also configured to receive a first data request operation on the distributed database, an execution component configured to process the first data request operation including at least one write request on at least one database instance managed by the database management component, and a fault prediction component configured to detect a potential page fault responsive to a target data of the write request, wherein the execution component is further configured to suspend execution of the first data request operation, request access a physical storage to read the target data into active memory, and re-execute the first data request operation after a period of time for suspending the first data request operation.

公开(公告)号：US09646036B2

公开(公告)日：2017-05-09

申请号：US14628829

申请日：2015-02-23

Applicant: MongoDB, Inc.

Inventor： Dwight Merriman ,  Eliot Horowitz

IPC: G06F12/08 ,  G06F17/30

CPC classification number: G06F17/3033 ,  G06F17/30333 ,  Y10S707/99942 ,  Y10S707/99945 ,  Y10S707/99957

Abstract: Aspects of the present invention are directed to system and methods for optimizing identification of locations within a search area using hash values. A hash value represents location information in a single dimension format. Computing points around some location includes calculating an identification boundary that surrounds the location of interest based on the location's hash value. The identification boundary is expanded until it exceeds a search area defined by the location and a distance. Points around the location can be identified based on having associated hash values that fall within the identification boundary. Hashing operations let a system reduce the geometric work (i.e. searching inside boundaries) and processing required, by computing straightforward operations on hash quantities (e.g. searching a linear range of geohashes), instead of, for example, point to point comparisons.

公开(公告)号：US09262462B2

公开(公告)日：2016-02-16

申请号：US13951987

申请日：2013-07-26

Applicant: MongoDB, Inc.

Inventor： Dwight Merriman ,  Eliot Horowitz ,  Chris Todd Westin

IPC: G06F17/30

CPC classification number: G06F17/30569 ,  G06F17/30283 ,  G06F17/30345 ,  G06F17/30489 ,  G06F17/30545 ,  G06F17/30554 ,  G06F17/30563 ,  G06F17/30595 ,  G06F17/30864 ,  G06F17/3089

Abstract: Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.

公开(公告)号：US20150161122A1

公开(公告)日：2015-06-11

申请号：US14628829

申请日：2015-02-23

Applicant: MongoDB, Inc.

Inventor： Dwight Merriman ,  Eliot Horowitz

IPC: G06F17/30

CPC classification number: G06F17/3033 ,  G06F17/30333 ,  Y10S707/99942 ,  Y10S707/99945 ,  Y10S707/99957

Abstract: Aspects of the present invention are directed to system and methods for optimizing identification of locations within a search area using hash values. A hash value represents location information in a single dimension format. Computing points around some location includes calculating an identification boundary that surrounds the location of interest based on the location's hash value. The identification boundary is expanded until it exceeds a search area defined by the location and a distance. Points around the location can be identified based on having associated hash values that fall within the identification boundary. Hashing operations let a system reduce the geometric work (i.e. searching inside boundaries) and processing required, by computing straightforward operations on hash quantities (e.g. searching a linear range of geohashes), instead of, for example, point to point comparisons.

Abstract translation: 本发明的方面涉及使用散列值来优化搜索区域内的位置的识别的系统和方法。 散列值表示单维格式的位置信息。 围绕某个位置的计算点包括基于位置的哈希值计算围绕感兴趣位置的识别边界。 识别边界被扩展，直到它超过由位置和距离定义的搜索区域。 可以基于位于识别边界内的相关联的散列值来识别位置周围的点。 哈希操作可以通过计算哈希量的简单操作（例如搜索地理学的线性范围）来减少几何工作（即边界内的搜索）和所需的处理，而不是例如点对点比较。