Abstract: A system includes generation of a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client, serialization of the second table into the volatile memory, copying of the serialized second table into a second volatile memory of a data server, de-serialization of the serialized second table into the second volatile memory, determination of a plurality of entries of the first database table which are associated with the second table, and determination of the result set from the plurality of entries based on the query parameters.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system includes generation of a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client, serialization of the second table into the volatile memory, copying of the serialized second table into a second volatile memory of a data server, de-serialization of the serialized second table into the second volatile memory, determination of a plurality of entries of the first database table which are associated with the second table, and determination of the result set from the plurality of entries based on the query parameters.

Abstract: Systems and methods consistent with the invention may include storing, in a memory device of the computer system, a node including existing data values stored in a sequence, including in the node an insert position value and an append count value, the insert position value providing a position in the node where one of the existing data values is included, and the append count value being a counter value that is modified based on the inclusion of the existing data values in the node; receiving a new data value; determining a location in the memory device for storing the new data value, wherein the location is determined based on at least one of a type of the new data value, the sequence, and the append count value; and storing the new data value in the determined location.