-
公开(公告)号: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.
-
公开(公告)号:US12124611B2
公开(公告)日:2024-10-22
申请号:US17737172
申请日:2022-05-05
申请人: Google LLC
发明人: Michael Daub , Scott Schneider , Joseph Sean Cahill Goodknight Knightbrook , Sheng Ma , Laura Book
CPC分类号: G06F21/6254 , G06F16/212 , G06F16/2255 , G06F21/6245 , G06Q30/0246 , H04L9/0643 , H04L63/0407 , H04L63/0428
摘要: At least one aspect is directed to determining an estimate of an intersection of user identifiers in a first set of user identifiers and a second set of user identifiers. The first and second sets of user identifiers can be populated with user identifiers that have interacted with the same content item or content item campaign. Estimates of intersections of the first and the second sets can be determined based on a binomial vector approach, a vector of counts approach, or a hybrid approach. The binomial vector approach generates vectors based on k hashes of each user identifier in the first set and summing the vectors to generate a first vector. The intersection can be determined based on a dot product of the first vector and a second vector similarly generated from the second set of user identifiers.
-
公开(公告)号:US20240330499A1
公开(公告)日:2024-10-03
申请号:US18621843
申请日:2024-03-29
发明人: Braden Thomas , Philip Thrasher , Joanna Doute
CPC分类号: G06F21/6218 , G06F8/61 , G06F16/2255
摘要: In one example, a system comprises a digital forensic access device executing instructions to install an access agent on a target device and to replace the access agent with an extraction agent after the access agent locates and copies data in the target device into a data structure; and a computing device running an extraction server comprising instructions to store a copy of the data structure in storage and to remove the extraction agent from the target device.
-
公开(公告)号:US12099497B2
公开(公告)日:2024-09-24
申请号:US17658850
申请日:2022-04-12
发明人: Sarfaraz Ali , Faiz Ahmed , Srinivas Kadhire
CPC分类号: G06F16/2379 , G06F16/2246 , G06F16/2255
摘要: 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.
-
公开(公告)号:US12085417B2
公开(公告)日:2024-09-10
申请号:US17953111
申请日:2022-09-26
IPC分类号: G01D21/00 , G01D9/00 , G06F16/22 , H04L67/1097 , H04Q9/00
CPC分类号: G01D21/00 , G01D9/005 , G06F16/2255 , H04L67/1097 , H04Q9/00 , H04Q2209/43
摘要: 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.
-
公开(公告)号:US20240289314A1
公开(公告)日:2024-08-29
申请号:US18654985
申请日:2024-05-03
申请人: SAP SE
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.
-
公开(公告)号:US12062026B2
公开(公告)日:2024-08-13
申请号:US18353426
申请日:2023-07-17
申请人: Painted Dog, Inc.
发明人: Jared Max Browarnik , Ken Aizawa
IPC分类号: G06Q20/12 , G06F9/54 , G06F16/22 , G06F16/71 , G06F16/78 , G06V10/764 , G06V10/77 , G06V20/40 , H04N21/472 , H04N21/478
CPC分类号: G06Q20/123 , G06F9/547 , G06F16/2255 , G06F16/71 , G06F16/7867 , G06V10/764 , G06V10/7715 , G06V20/40 , H04N21/47217 , H04N21/47815 , G06V20/48 , G06V2201/10
摘要: Shoppable video enables a viewer to identify and buy items appearing in a video. To retrieve information about the items in a frame of the video, the playback device generates a perceptual hash of that frame and uses that hash to query a first database storing perceptual hashes of different version of the video. The database query returns an identifier for the frame, which is then used to query a second database that store the item information. The results of this query are returned to the playback device, which shows them to the user, enabling the viewer to learn more about and possibly purchase the item. Using queries based on perceptual hashes of different versions of the video increases the likelihood of returning a match, despite formatting differences. And using separate hash and metadata databases makes it possible to update the metadata without changing the hashes.
-
公开(公告)号:US12061708B1
公开(公告)日:2024-08-13
申请号:US16586073
申请日:2019-09-27
发明人: Akhilesh Mritunjai , Wan Man Ryan Chan , Yogesh Kansal , Tushar Rakheja , Jason Kroll , Xi Huang
CPC分类号: G06F21/604 , G06F3/0631 , G06F3/0638 , G06F16/2255 , G06F16/2272 , G06F21/57 , G06F21/6227
摘要: Various embodiments are described for tracking and enabling access to information about key access patterns for database tables managed by a database service of a service provider network. Storage nodes can store data as key-value pairs (or key-document pairs), where the records or documents of a database are addressed by a unique key for each record. The storage nodes over time receive requests to perform various operations (for example, to get, put, update, or delete data in a table) associated with records stored by the storage nodes. Key access information extractors collect information regarding the keys accessed and send the information to a key tracking service. Key tracker nodes of the service can collect the data and send it to aggregator nodes. The aggregator nodes can determine a frequency with which such requests are received for keys of a partition or table to which the aggregator node is assigned.
-
公开(公告)号:US20240265000A1
公开(公告)日:2024-08-08
申请号:US18409289
申请日:2024-01-10
CPC分类号: G06F16/2365 , G06F11/1464 , G06F16/2255 , H04L9/3239 , H04L9/3297 , G06F2201/84 , H04L9/50 , H04L2209/56
摘要: 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.
-
公开(公告)号:US20240264994A1
公开(公告)日:2024-08-08
申请号:US18310459
申请日:2023-05-01
申请人: Oxla sp. z o.o.
发明人: Adam Szymanski , Grzegorz Dudek
IPC分类号: G06F16/22 , G06F16/2455
CPC分类号: G06F16/2255 , G06F16/2237 , 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.
-
-
-
-
-
-
-
-
-