LOCATING A VALUE THROUGH DETERMINISTIC SEARCHING

    公开(公告)号:US20240362224A1

    公开(公告)日:2024-10-31

    申请号:US18767767

    申请日:2024-07-09

    申请人: PURE STORAGE, INC

    发明人: ETHAN L. MILLER

    IPC分类号: G06F16/2455 G06F16/22

    CPC分类号: G06F16/2455 G06F16/2255

    摘要: A method for efficiently supporting deletion in a probabilistic data structure, and related computing or storage system are described. A processor, computing system or storage system constructs a table and a summary table for determining whether there is an entry for a value in the table. The summary table has buckets pointed to by address fields of values. Each bucket has a prefix table, a transit table, signature table and a first indicator. The system tracks deletion and addition of items of the table and summary table through the first indicators.

    Incremental data clustering model for basket analysis by prediction services

    公开(公告)号:US12099497B2

    公开(公告)日:2024-09-24

    申请号:US17658850

    申请日:2022-04-12

    IPC分类号: G06F16/23 G06F16/22

    摘要: A data model is derived from transaction data. The model is represented in a combination data structure for a tree and a hash table. The hash table provides direct access to leaves of the tree, each leaf comprises a frequency count for a particular unique basket of items detected in the transaction data. Mining the combination data structure does not require recursive traversal of the tree. Moreover, derivation is performed with just two passes on the transaction data, during each pass multiple concurrent reducer tasks handle a unique portion of the transaction data providing parallel processing during creation and derivation which improves the processor elapsed time to complete the combination data structure. Furthermore, updates to the data structure are incremental without requiring any additional passes on the original transaction data and without requiring full traversal of the tree. Output from the mining is provided as input to predictor services.

    Sensor system
    5.
    发明授权

    公开(公告)号:US12085417B2

    公开(公告)日:2024-09-10

    申请号:US17953111

    申请日:2022-09-26

    摘要: Described are systems and methods to provide agnostic sensor data obtained from a sensor and transmitted to a central database by a transmitter device. In one aspect, a value sensed by a sensor component is converted at the transmitter device to an agnostic value defined by a dimensionless universal scale and offset. The agnostic value is then sent to a data acquisition database where it is converted back to the original value. This is accomplished by first providing the data acquisition database with a sensor definition of a scale and offset used to convert the sensor values in addition to any sensor indicia and other parameters to display the data acquired at the data acquisition database. The wireless sensors database and user interface are also automatically updated when a new sensor type is attached to the network utilizing configuration data that resides in the new sensor that is sent to the database on its first connection.

    PAGEABLE HASH INDEX FOR DOCUMENT STORE
    6.
    发明公开

    公开(公告)号:US20240289314A1

    公开(公告)日:2024-08-29

    申请号:US18654985

    申请日:2024-05-03

    申请人: SAP SE

    IPC分类号: G06F16/22 G06F16/93

    CPC分类号: G06F16/2255 G06F16/94

    摘要: A method, a system, and a computer program product for generating a pageable hash index for a document store. A hash map index for data stored on disk using a document array is generated. The hash map index includes a plurality of hash values with each hash value identifying a document stored at a predetermined location in the document array. A transaction for executing using a first document stored in the document array is received. Using the generated hash map index, a location of the first document stored in the document array is identified. At least a portion of a first hash value of the hash map index corresponding to the first document is loaded into a memory location without loading the remaining hashes of the hash map index. Based on the loaded portion of the first hash value, the received transaction is executed.

    ENSURING DATA INTEGRITY OF EXECUTED TRANSACTIONS

    公开(公告)号:US20240265000A1

    公开(公告)日:2024-08-08

    申请号:US18409289

    申请日:2024-01-10

    摘要: A central service provider manages a blockchain network that writes the cryptographic hash of each executed transaction in a block to the blockchain network. For each executed transaction, the central service provider generates and transmits a transaction receipt such that a party can verify that the transaction was appropriately executed. Additionally, a party can check that the party's records are correct by providing transaction data describing details of transactions recorded in the party's records to the central service provider. The central service provider verifies the party's records by comparing the transaction data in the party's records to the blocks of transaction records in the blockchain network. In some scenarios, the central service provider may identify or receive an identification of a discrepancy arising from one or more transactions. The central service provider can reconcile the identified discrepancy.

    STORAGE EFFICIENT MULTIMAPS FOR PROCESSING DATABASE QUERIES

    公开(公告)号:US20240264994A1

    公开(公告)日:2024-08-08

    申请号:US18310459

    申请日:2023-05-01

    申请人: Oxla sp. z o.o.

    IPC分类号: G06F16/22 G06F16/2455

    摘要: A database system uses a hash table for processing database queries. The system stores keys mapped to data values in the hash table. For processing a set of records using the hash table, the system partially sorts the records to match the order of keys of the hash table. The partial storing of the records results in improving the performance of a cache storing the hash table. The hash table may be a multimap that maps a key to multiple data values. The system stores data values mapped to a key in a vector that stores all data values mapped to the key in contiguous memory. The system stores a pointer to the vector in association with the key in the multimap. The system optimizes the multimap to store the data value instead of the pointer if there is a single data value associated with a key.