International Business Machines Corporation

Verizon Patent and Licensing Inc.

Oath Inc.

Yahoo Assets LLC

Verizon Media Inc.

Ohad Shacham

Edward Bortnikov

Oded Fuhrmann

Idit Keidar

Rachel Tzoref

Daniel Geist

Yonatan Gottesman

Alexander Libov

Mark Ginzburg

Yoad Lustig

Boris Kapchits

Ishai Rabinovitz

Sharon Keidar-Barner

Eshcar Hillel

Karen Frida Yorav

Dmitry Basin

Gali Sheffi

Omer Bar-Ilan

Sameer Paranjpye

Jason Raymond Baumgartner

Eran Yahav

Martin Vechev

Jiazhao Xu

Cynthia Rae Eisner

Tatyana Veksler

Sitvanit Ruah

Paul Joseph Roessler

Eran Meir

Ishai Rabinovotz

Shlomo Hoory

Technologies for selectively streaming video based on mapping buffer data to download rates. The technologies can include sampling download rates of a video player prior to or during downloading of a first video segment to the video player. The technologies can include determining a range of download rates of the video player based at least on the sampled download rates. The technologies can include determining an amount of accumulated video data in a buffer of the video player immediately prior to or during the downloading of the first video segment. Also, the technologies can include mapping the determined amount of accumulated video data to a download rate within the determined range of download rates using a mapping function, and determining a second video segment quality for a second video segment based at least on the mapped download rate.

Selective streaming of video segments based on buffer data and download rate range

In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.

Method for approximate k-nearest-neighbor search on parallel hardware accelerators

One or more computing devices, systems, and/or methods for automated materialized view table generation and maintenance are provided. A log, comprising queries and latencies of processing the queries, is evaluated to identify a list of combinations of fields that occur greater than a threshold frequency and/or occur in queries having latencies greater than a threshold latency. A materialized view generation script is executed against a main database to generate a materialized view table associated with a combination of one or more fields from the list. A middleware component is configured to selectively direct a query to the main database or to the materialized view table based upon whether the materialized view table comprises preliminary query results for fields specified by the query.

Automated materialized view table generation and maintenance

Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

Systems, devices, and methods for content indexing and querying in a search system

Multi-thread systems and methods are described for concurrently handling requests to commit data updates to a database by a plurality of data transactions. The database preferably supports multi-versioning and the data transactions are preferably isolated by snapshot isolation. In one embodiment, concurrent and lock-free handling of requests to commit data updates includes performing two types of concurrent data conflict detection. A transaction proceeds to commit only if it passes both types of conflict detection. The first type of conflict detection is based on a hash map between data keys and their commit timestamps whereas the second type of conflict detection is based on a log that keeps track of the status of transactions whose requests to commit are actively being processed. In another embodiment, concurrent conflict detection for data items in concurrent transactions is broken down into buckets and locks are used for accessing each bucket. These systems and methods maintain transactional integrity to database while improving throughput by maximizing concurrency of data commits in a multi-thread environment.

Scalable conflict detection in transaction management

Briefly, embodiments disclosed herein relate to managing transactions in a distributed content transaction system.

Management of transactions in a distributed transaction system

The present teaching relates to committing transactions over a database in a semi-distributed manner. In one example, a transaction is executed to access a plurality of keys stored in the database. A request is transmitted to a transaction management engine to commit the transaction. The transaction management engine performs a conflict check between the transaction and one or more transactions running concurrently with the transaction, and generates an instruction based on the conflict check. The instruction is received from the transaction management engine. Based on the instruction, one or more of the plurality of keys are updated in the database or data added by the transaction to the database are erased.

Method and system for committing transactions in a semi-distributed manner

A CNF formula comprises at least one template clause representing a set of concrete clauses, each associated with a different temporal shift. The template clause is utilized by a SAT solver in determining satisfiability of the CNF formula. The template clause may be utilized to reduce amount of storage resources required for performing the satisfiability analysis. The template clause may in some cases increase feasibility of determining satisfiability. The template clause may in some cases reduce required time to determine satisfiability. The template clause may be utilized in incremental SAT solving to reuse deduced relations between literals that are applicable to additional cycles, such as invariants originating from a transition relation of a model.

Template clauses based SAT techniques

Systems and methods that use a solver to find bugs in a target model of a computing system having one or more finite computation paths are provided. The bugs on computation paths of less than a predetermined length are detected by translating the target model to include a state variable AF for one or more states of the target model, wherein AF(S) represents value of the state variable AF at state S; and solving the translated version of the target model that satisfies predetermined constrains.

Satisfiability (SAT) based bounded model checkers

Soft error detection is performed by computation of states based on formal methods and by simulating a synthesized target identification logic together with the design. Soft errors may be simulated in response to detecting that a simulated state of the design is comprised by the states. A BDD representation of the design may be utilized to determine the states. A Boolean satisfiability problem may be defined and solved using an all-SAT solver in order to determine the states.

Soft error verification in hardware designs

Growing community of inventors

Kfar Monash, Israel

Ohad Shacham