Amadeus S.a.s.

Didier Spezia

Pierre Dor

Nicolas Krasensky

Xavier Bourgouin

Enrico Mano

Jose Morales Aragon

Marcos Rodriguez Palacios

Clement Seveillac

Damien Profeta

Simon Huet

A distributed computer system for delivering data to client-side application(s) is provided. The system includes a database configured to store immutable data blocks, a data distribution entity configured to split source-data into immutable data blocks and metadata. The data distribution entity is configured to replicate and store the data blocks on different storage nodes(s) of the database. The metadata comprises values referencing the data blocks for a key-value database call. The system further comprises a data fetching/delivering entity with a fuse-daemon configured to form a quorum read request for data block(s) out of a client-side request for a certain data range. The quorum-read request is a bundle of parallel requests to different storage nodes. The fuse-daemon is configured to fetch the data blocks delivered in the fastest response and to discard the rest. The fuse-daemon generates a virtual file comprising the corresponding range of data from the fetched data blocks.

Distributed computer system for delivering data

Methods and systems for determining one most specific row within a database table. An index includes an index structure for each column of the database table. Each index structure includes an array of pointer tuples for each value occurring in the column and a bitmap indicating cells without values. A first pointer of the tuple indicates a value and a second pointer indicates the row of the database table with the value. The index also indicates an order of specificity of the rows of the database table. A computer system processes a request by using the bitmaps of the index structures to maintain all rows of the database table without values and the pointer tuples to filter all rows of the database table that do not include the respective input value. The one row being highest in the order of specificity from the remaining rows is selected and returned.

Database table index

System and method of sequencing distributed asynchronous messages. An inbound handler receives an incoming message with a sequence correlation value that identifies a sequence comprising the incoming message, and checks for a sequence status of the sequence. If the sequence status indicates that none of multiple outbound handlers is currently processing a message for the sequence and if the incoming message is the next message to be processed for the sequence, then the incoming message is forwarded to a queue storage and subsequently forwarded to an available outbound handler. If the sequence status indicates that at least one of the outbound handlers is currently processing a message of the sequence, if the queue storage already comprises a message to be processed for the sequence, or if the incoming message is not the next message to be processed for the sequence, then the incoming message is stored in overflow storage.

Method, system and computer program product for sequencing asynchronous messages in a distributed and parallel environment

Growing community of inventors

Nice, France

Didier Spezia