Amazon Technologies, Inc.

Google Inc.

Yingjie He

Gopi K Attaluri

Saileshwar Krishnamurthy

Kamal Kant Gupta

Yongsik Yoon

Alexandre Olegovich Verbitski

Dhruva Ranjan Chakrabarti

Atrayee Mullick

Saraswathy Narayan

Ullas Gargi

Tengiz Kharatishvili

Christian Weitenberner

David Rosenstein

Xin Chen

Harris Cohen

Kevin Song Zhu

Damien Katz

Siddharth Shankar

Brian Karlak

Girum Ibssa

Krishmin Rai

Arthur Vincent Joseph Gaudriot

Lucas Pollock

Francois-Xavier Nuttall

Reuben Kuhnert

Patrice Lauriston

Suhas Keshavamurthy

Huawei Wang

Jianguo Wang

Thorvald Natvig

James Frederick Mattly

Storage-side filtering may be implemented for performing hash join operations with respect to data stored in distributed data storage. When a query to a database stored in a distributed data store is received, a hash join operation may be identified for performing the query. As part of performing the hash join operation, a query engine may cause storage nodes in the distributed data storing data for the database to filter data before sending the data to the query engine according to a join predicate for the hash join operation. A result of the query may then be provided to a user, using the filtered data provided from the storage nodes.

Storage-side filtering for performing hash joins

A method includes obtaining a query to perform an operation on a tuple of a plurality of tuples stored at a database. Each respective tuple assigned a respective transaction identifier (ID) from a set of transaction IDs. The set of transaction IDs includes a subset of unavailable transaction IDs each currently assigned to one of the tuples and a subset of available transaction IDs each currently unassigned to any tuple. The method also includes assigning one of the available transaction IDs to the tuple based on the query and determining an oldest transaction ID age from the set of transaction IDs. The method also includes determining that the oldest transaction ID age satisfies a threshold and performing a garbage collection process on the database based on determining that the oldest transaction ID age satisfies the threshold.

Adaptive auto garbage collector in MVCC database system

Transaction statements may be forwarded for a database transaction. A transaction begun at a read-only node may include a write statement. The read-only node may forward the write statement to the read-only node to perform as a transaction. The read-only node may update a read view for the transaction to include the write statement before performing a read statement submitted after the write statement at the read-only node.

Selective forwarding for multi-statement database transactions

Database commands may be asynchronously forwarded between nodes of a database system. A read-only node may receive a request, such as a read request or write request, and determine that the request should be forwarded to a read-only node for performance. A thread that handles the request may forward the request to the read-only node and register a call-back event for a response to the request and be made available to perform other work. When the response from the read-write node is received, the call-back event may be triggered and return a response to the request using the same or different thread.

Asynchronously forwarding database commands

Methods, systems, and media for determining and presenting information related to embedded sound recordings are provided. In some embodiments, the method comprises: identifying, at a video sharing service, a first video content item that includes an embedded sound recording; identifying a composition associated with the embedded sound recording, wherein the embedded sound recording is a particular version of the composition; identifying one or more artists associated with the composition based on a group of metadata associated with the composition, wherein each item of metadata is provided by a content owner that has provided a sound recording associated with the composition to the video sharing service; identifying a second video content item associated with the embedder sound recording based at least in part on the identified one or more artists; receiving, from a user device, a request to present the first video content item on the user device; and, in response to receiving the request, causing the user device to present a user interface for presenting the first video content item in a first portion of the user interface and information related to the embedded sound recording in a second portion of the user interface, wherein the information related to the embedded sound recording includes indications of the one or more artists and a link to the second video content item.

Methods, systems, and media for determining and presenting information related to embedded sound recordings

Automatic consistency is implemented for forwarding writes in a database system. A read-only node may support both read and write requests to a database. The read only node may forward write requests to a read-write node. The read-only node may determine whether to include the forwarded requests in a version of the database for a read request automatically according to a consistency specified for a read request.

Automatic consistency for database write forwarding

A hybrid query engine using different query engines may be implemented to provide access to a database. A database query to a database may be received at a hybrid query engine. A plan to perform the database query may be generated that when performed by the hybrid query engine causes one query engine to perform an assigned portion of the plan by accessing data that describes the database. Another portion of the plan assigned to another query engine may be performed by the hybrid query engine to cause the other query engine to perform the other portion of the plan by accessing the same data that describes the database.

Hybrid query execution engine using transaction and analytical engines

Transactional scans of portions of a database may be performed. When a query is received that causes a scan of a database, different portions of the database may be scanned within separate transactions. Operations applicable to perform the scan the records of the different portions of the database may be invoked once within the transactions instead of invoking the operations individually for each of the records in the different portions. Results of the query based on the scanned portions may then be provided in response to the query.

Transactional scanning of portions of a database

Filtered generation of hash tables may be implemented as part of performing a hash join. A database query may be received that causes a hash join to be performed in order to join two database tables. A filtered generated from a scan of one of the tables that indicates which data in the table can satisfy a join predicate for the hash join may be applied to generate a hash table from a portion of the other table. The filtered hash table may then be used to evaluate whether portions of the tables can be joined in satisfaction of the join predicate for the hash join.

Filtered hash table generation for performing hash joins

Growing community of inventors

Cupertino, CA, United States of America

Yingjie He