Abstract: A method performs efficient data searches in a distributed computing system. The method may include, receiving a first key. The method may further include determining a hash map associated with the first key from among a plurality of hash maps. In some examples, the obtained hash map maps a partition of a set of keys to particular index values. The method may further include determining an index value associated with a second key using the determined hash map. The method may further include determining transaction processing data associated with the first key using the determined index value and providing the transaction processing data. Utilization of the plurality of hash maps may enable a data search to be performed using on-board memory of an electronic device of the distributed computing system.

Abstract: Provided is a computer-implemented method for performing analysis of transaction data. The method may include receiving streaming data, wherein the streaming data comprises a plurality of data identifiers and transaction data associated with each transaction of a plurality of transactions, wherein each data identifier is associated with transaction data associated with a transaction so that the transaction data associated with each transaction is separated by a data identifier, filtering the streaming data using at least one predetermined data identifier value to provide filtered transaction data, determining whether the filtered transaction data corresponds to at least one predetermined transaction parameter, and asynchronously storing the filtered transaction data associated with the at least one transaction in at least one data structure. A system and computer program product are also disclosed.

Abstract: A method performs efficient data searches in a distributed computing system. The method may include, receiving a first key. The method may further include determining a hash map associated with the first key from among a plurality of hash maps. In some examples, the obtained hash map maps a partition of a set of keys to particular index values. The method may further include determining an index value associated with a second key using the determined hash map. The method may further include determining transaction processing data associated with the first key using the determined index value and providing the transaction processing data. Utilization of the plurality of hash maps may enable a data search to be performed using on-board memory of an electronic device of the distributed computing system.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: Embodiments of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a first key. The method may further comprise determining a hash map associated with the first key from among a plurality of hash maps. In some examples, the obtained hash map maps a partition of a set of keys to particular index values. The method may further comprise determining an index value associated with a second key using the determined hash map. The method may further comprise determining transaction processing data associated with the first key using the determined index value and providing the transaction processing data. Utilization of the plurality of hash maps may enable a data search to be performed using on-board memory of an electronic device of the distributed computing system.

Abstract: One embodiment of the invention is directed to a method for performing efficient key range searches in a distributed computing system. The method may comprise, receiving a first key (e.g., an alphanumeric identifier). A key range tree map associated with the first key may be identified from a plurality of key range tree maps. In some embodiments, individual key range tree maps map a set of minimum range values to a set of index values. The method may further comprise determining an index value associated with a second key using the determined key range tree map. Transaction processing data associated with the first key may be determined using the index value and provided to the requesting source. Utilizing the plurality of key range tree maps as described herein enables a key range search to be performed using on-board memory of an electronic device.

Abstract: One embodiment of the invention is directed to a method for performing efficient key range searches in a distributed computing system. The method may comprise, receiving a first key (e.g., an alphanumeric identifier). A key range tree map associated with the first key may be identified from a plurality of key range tree maps. In some embodiments, individual key range tree maps map a set of minimum range values to a set of index values. The method may further comprise determining an index value associated with a second key using the determined key range tree map. Transaction processing data associated with the first key may be determined using the index value and provided to the requesting source. Utilizing the plurality of key range tree maps as described herein enables a key range search to be performed using on-board memory of an electronic device.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: Provided is a computer-implemented method for performing analysis of transaction data. The method may include receiving streaming data, wherein the streaming data comprises a plurality of data identifiers and transaction data associated with each transaction of a plurality of transactions, wherein each data identifier is associated with transaction data associated with a transaction so that the transaction data associated with each transaction is separated by a data identifier, filtering the streaming data using at least one predetermined data identifier value to provide filtered transaction data, determining whether the filtered transaction data corresponds to at least one predetermined transaction parameter, and asynchronously storing the filtered transaction data associated with the at least one transaction in at least one data structure. A system and computer program product are also disclosed.

Abstract: Provided is a computer-implemented method for performing analysis of transaction data. The method may include receiving streaming data, wherein the streaming data comprises a plurality of data identifiers and transaction data associated with each transaction of a plurality of transactions, wherein each data identifier is associated with transaction data associated with a transaction so that the transaction data associated with each transaction is separated by a data identifier, filtering the streaming data using at least one predetermined data identifier value to provide filtered transaction data, determining whether the filtered transaction data corresponds to at least one predetermined transaction parameter, and asynchronously storing the filtered transaction data associated with the at least one transaction in at least one data structure. A system and computer program product are also disclosed.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: Embodiments of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a first key. The method may further comprise determining a hash map asso- ciated with the first key from among a plurality of hash maps. In some examples, the obtained hash map maps a partition of a set of keys to particular index values. The method may further comprise determining an index value associated with a second key using the determined hash map. The method may further comprise determining transaction processing data associated with the first key using the determined index value and providing the transaction processing data. Utilization of the plurality of hash maps may enable a data search to be performed using on-board memory of an elec- tronic device of the distributed computing system.

Abstract: One embodiment of the invention is directed to a method for performing efficient key range searches in a distributed computing system. The method may comprise, receiving a first key (e.g., an alphanumeric identifier). A key range tree map associated with the first key may be identified from a plurality of key range tree maps. In some embodiments, individual key range tree maps map a set of minimum range values to a set of index values. The method may further comprise determining an index value associated with a second key using the determined key range tree map. Transaction processing data associated with the first key may be determined using the index value and provided to the requesting source. Utilizing the plurality of key range tree maps as described herein enables a key range search to be performed using on-board memory of an electronic device.

Abstract: Provided is a computer-implemented method for providing a transaction offset based on a transaction. The method may include receiving at least one predetermined data identifier value, receiving streaming data, wherein the streaming data comprises a plurality of data identifiers and transaction data associated with each transaction of a plurality of transactions, wherein each data identifier is associated with transaction data associated with a transaction so that the transaction data associated with each transaction is separated by a data identifier, filtering the streaming data using the at least one predetermined data identifier value to provide filtered data, wherein the filtered data includes filtered transaction data, determining whether the filtered transaction data corresponds to at least one predetermined transaction parameter, asynchronously storing the filtered transaction data associated with the at least one transaction in at least one data structure.