Microsoft Technology Licensing, LLC

Linkedin Corporation

Viking Pump, Inc.

Scott M Meyer

Andrew Joseph Carter

Srinath Shankar

Andrew Rodriguez

Walaa Eldin M Moustafa

Robert W Stephenson

Siddharth Rajendra Shah

Andrew Anderson

Ying Lu

Karan Rajen Parikh

Yongling Song

Joshua D Ehrlich

Shyam Shankar

Yejuan Long

Huaxin Liu

Justin Pierce

Xiaobin Ma

Michael Robert Crawford

Yan Yu

Brent D Miller

SungJu Cho

Bogdan George Arsintescu

Ionut Constandache

Christopher J Mihm

Qingpeng Niu

Roman A Averbukh

Maverick Shu-Bun Lee

Yinyi Wang

Yiming Yang

Joe Papp

Alfonso Johnson

Ryan Weide

Jiahong Zhu

Emily P Timm

Brian Atwood

Nicolas V Thompson

Josh Gerbig

Cameron Neff

Andrew J Carter

One or more techniques and/or systems are disclosed for an improved barrier seal for use on a rotating shaft of a pump to mitigate leakage of fluids along the shaft. The body of the barrier seal may comprise a one-piece combined bushing and seal that can be selectably fastened to the pump bracket. Internal and external channels in the body can operably hold gaskets, internally dynamic seals, and externally static seals, inside the stuffing box of the pump bracket. A lubricant port can be disposed on a flange of the seal portion to provide lubricant to the interior of the barrier seal, which can also be fluidly coupled with the outside of the seal. A pressurized lubricating fluid can also help mitigate leakage of pumped fluid by pressurizing between static gaskets on the outside, and provide lubrication for the rotating shaft on the inside of the seal.

Rotating pump shaft barrier seal

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

Enforcing path consistency in graph database path query evaluation

One or more techniques and/or systems are disclosed for mitigating fluid loss or leakage from a fluid pump with a rotating shaft driving a pumping mechanism. A seal gland component can have two or more internal seals formed by two or more seal components, such as O-rings, that create one or more chambers that act as a lubricant/barrier fluid reservoir to provide for reduced friction and mitigate release of gaseous emissions. Further, the seal gland component can be a retrofit on an existing shaft to provide for greater life and efficiency as compared to the existing packing gland or other sealing components. Further, the one or more internal seals can be arranged within the seal gland in an asymmetrical manner such that the seal gland can be removed from a shaft, rotated, and reinstalled with the internal seals contacting a different position on the surface of the shaft.

Pump gland with rotary dynamic seal

The disclosed embodiments provide a system for processing queries of a graph database storing a graph, wherein the graph comprises a set of edges defined by a first linkage, a second linkage, and a third linkage. During operation, the system maintains the base version of an index of the graph database. Upon branching a version of the graph database from a first offset representing a virtual time in the base version of the graph database, the system creates a branched version of the index from a second offset corresponding to the virtual time in the base version of the index. The system then processes queries of the graph database based on the offsets and references from the branched version of the index to the base version of the index.

Branch threading in graph databases

A pump technology that provides for more effective and efficient transfer of liquids, such as petroleum products and components, to and through pipelines. Such a technology can comprise a type of external gear pump that creates higher flow, resulting in higher pressures in the pipeline, to move the liquids, while providing for longer pump life, simpler and less maintenance, and fewer undesired conditions, with a smaller footprint, in a cost-effective system. Further, one or more portions of the pump can be configured to be easily replaceable to provide for maintenance in place, and provide for longer pump life. Additionally, one or more portions of the pump can be constructed with or coated with abrasive resistant material that extends the life of the external gear pump. Such material can also reduce the friction between surfaces and improve the life of the external gear pump under poor feeding conditions.

High pressure pumping system

One or more techniques and/or systems are disclosed for a pump technology that provides for more effective and efficient transfer of liquids, such as petroleum products and components, to and through pipelines. Such a technology can comprise a type of external gear pump that creates higher flow, resulting in higher pressures in the pipeline, to move the liquids, while providing for longer pump life, simpler and less maintenance, and fewer undesired conditions, with a smaller footprint, in a cost-effective system.

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of a query in a structure comprising rows in a set of tables. Next, the system applies one or more operations to existing rows in the structure to generate additional rows in additional tables of the structure. The system also tracks inputs and outputs associated with the one or more operations in a set of relationships between rows of different tables in the structure. Finally, the system uses the rows and the set of relationships to generate a final result of the query and provides the final result in a response to the query.

Path query evaluation in graph databases

The disclosed embodiments provide a system for performing unified error monitoring, alerting, and debugging of distributed systems. During operation, the system receives logs of activity within a distributed system over event streams in a distributed streaming platform. Upon identifying an error in the received logs, the system collects, from the event streams, log entries generated within a time window of the error into a contextual log associated with the error. The system then outputs an alert containing metadata for accessing the contextual log.

Unified error monitoring, alerting, and debugging of distributed systems

The disclosed embodiments provide a system that searches a graph database. During operation, the system obtains a log-based representation of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system obtains a first query containing a first search pattern for searching the log-based representation. The system then matches the first search pattern to one or more records in the log-based representation. Finally, the system outputs, as a first result of the first query, the one or more records in a subgraph of the graph.

Pattern-based searching of log-based representations of graph databases

During operation, a system for processing queries of a graph database executes a set of processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system obtains, from the query, a compound comprising a compound type and a set of identity-giving nodes. Next, the system uses the compound to access a tuple for storage in a log-based representation of the graph database, wherein the tuple includes the compound type and the identity-giving nodes. The system then uses the tuple to generate a result of the query and provides the result in a response to the query.

Supporting tuples in log-based representations of graph databases

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes a set of processes for maintaining the graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a write query of the graph database is received, the system uses one or more of the processes to process the write query by using a schema of the graph database to validate the write query. Next, the system transmits the validated write query to a set of shards containing the graph database. Finally, the system processes the write query at each shard when a shard identifier representing the shard is matched to one or more attributes in the write query.

Distributed graph database writes

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes a set of processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system performs a lookup of a hash map to obtain one or more offsets into a compound store for the graph database, which includes identity-giving nodes for a set of tuples in the graph database. Next, the system accesses the offset(s) in the compound store to obtain a subset of tuples matching the query. The system then uses the subset of tuples to generate a result of the query and provides the result in a response to the query.

Compound indexes for graph databases

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes one or more processes for providing the graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system receives a query containing a missing value parameter, wherein the missing value parameter designates an attribute in the graph database with a nonexistent value. The system then produces, from the query, a transformed query comprising one or more parameters that do not include the missing value parameter. Finally, the system uses the transformed query and the graph database to generate a result of the query and provides the result in a response to the query.

Transforming and evaluating missing values in graph databases

The disclosed embodiments provide a system for updating an index structure of a graph database storing a graph. During operation, the system includes, in the index structure, a first compressed edge store containing a first compact representation of edges in the graph at a first virtual time and a first series of updates to the edges after the first virtual time. At a second virtual time, the system creates a second compact representation of the edges from the first compact representation and the first series of updates. The system then appends, to the second compact representation, a second series of updates to the edges after the second virtual time to produce a second compressed edge store. Finally, the system updates the index structure by atomically replacing, in the index structure, a reference to the first compressed edge store with a reference to the second compressed edge store.

Growing community of inventors

Berkeley, CA, United States of America

Scott M Meyer