G06F16/2264

SEARCH FILTERED FILE SYSTEM USING SECONDARY STORAGE, INCLUDING MULTI-DIMENSIONAL INDEXING AND SEARCHING OF ARCHIVED FILES

Techniques for enabling user search of content stored in a file archive include providing a search interface comprising a search rules portion and an action rules portion, receiving a file archive search criterion comprising at least one search rule, and searching the file archive using the search criterion. The techniques also include generating a set of files filtered using the search criterion and performing an action specified in the action rules portion on a file included in the set of files.

COMPUTER DATA SYSTEM DATA SOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH

Described are methods, systems and computer readable media for data source refreshing.

Building of tries over sorted keys

Techniques are disclosed relating to building an in-memory multi-level data structure useable to determine presence or absence of key ranges in files consisting of database records. In various embodiments, a computer system operates a database, including maintaining a set of records having a set of corresponding keys that are accessible in key-sorted order and generates a multi-level data structure that facilitates key range lookups against the set of records. The generating may include accessing ones of the set of keys in key-sorted order and determining, for a particular accessed key that includes a set of characters, an intermediate level within the multi-level data structure and a subset of the characters of the particular accessed key for insertion. The computer system may insert, starting at the intermediate level, information that identifies the subset of characters, with the inserting being performed without traversing any levels before the intermediate level.

PROCESSING INGESTED DATA TO IDENTIFY ANOMALIES

Systems and methods are described for processing ingested data in an asynchronous manner as the data is being ingested to detect potential anomalies. For example, one or more streaming data processors can convert data as the data is ingested into a comparable data structure, determine whether the comparable data structure should be assigned to an existing data pattern or a new data pattern, and optionally update a characteristic of the data pattern to which the comparable data structure is assigned. The streaming data processor(s) can perform these operations automatically in real-time or in periodic batches. Once one or more comparable data structures have been assigned to one or more data patterns, the streaming data processor(s) can analyze the comparable data structures assigned to a particular data pattern to determine whether any of the comparable data structures appear to be anomalous.

DEPLOYING PHYSICAL DIAMOND TOKENS ON A BLOCKCHAIN
20230237474 · 2023-07-27 ·

A diamond asset comprising one or more diamonds and an encryption chip is used to asset-back a cryptographic token that can be used to conduct transactions. The cryptographic token is written to a blockchain using a smart contract that is configured to enable a transaction associated with the token in response to two or more of: a signature by the encryption chip, a signature by the owner of the diamond asset, and a validation of a visual layout of the diamond asset.

MACHINE-LEARNING TECHNIQUES FOR EVALUATING SUITABILITY OF CANDIDATE DATASETS FOR TARGET APPLICATIONS
20230004869 · 2023-01-05 ·

Techniques disclosed herein relate generally to evaluating and selecting candidate datasets for use by software applications, such as selecting candidate datasets for training machine-learning models used in software applications. Various machine-learning and other data science techniques are used to identify unique entities in a candidate dataset that are likely to be part of target entities for a software application. A merit attribute is then determined for the candidate dataset based on the number of unique entities that are likely to be part of the target entities, and weights associated with these unique entities. The merit attribute is used to identify the most efficient or most cost-effective candidate dataset for the software application.

DATA PROCESSING METHOD AND DEVICE

In a data processing method, a processing device performs encoding, based on spatial position data and time position data of a trajectory point of a trajectory according to an encoding rule of a hybrid code of a preset level in an index database, to obtain a hybrid code of each trajectory point. The hybrid code includes temporal information and spatial position information of the trajectory point. The processing device then queries a similar trajectory in the index database based on the hybrid code of each trajectory point. The index database includes hybrid codes of a plurality of levels, and the index database includes hybrid codes with trajectory information that includes a trajectory identifier and a trajectory length.

Message Object Traversal In High-Performance Network Messaging Architecture
20230027817 · 2023-01-26 · ·

A communications system implements instructions including maintaining a message object that includes an array of entries. Each entry of the array includes a field identifier, a data type, and a next entry pointer. The next entry pointers and a head pointer establish a linked list of entries. The instructions include, in response to a request to add a new entry to the message object, calculating an index based on a field identifier of the new entry and determining whether the entry at the calculated index within the array of entries is active. The instructions include, if the entry is inactive, writing a data type, field identifier, and data value of the new entry to the calculated index, and inserting the new entry into the linked list. The instructions include, if the entry is already active, selectively expanding the size of the array and repeating the calculating and determining.

TEMPORAL GRAPH ANALYTICS ON PERSISTENT MEMORY

Systems, apparatuses and methods may provide for technology that includes a single server to store a portion of a temporal graph to a first memory of the single server, and store a second portion of the temporal graph to a second memory of the single server, wherein an access rate of the first memory is greater than an access rate of the second memory, and wherein a capacity of the second memory is greater than a capacity of the first memory. The single server may also retrieve vertices of the second portion in response to a selectivity of an input query exceeding a cost model threshold.

LOOKUP AND RELATIONSHIP CACHES FOR DYNAMIC FETCHING

Disclosed are methods, systems, and computer-readable medium for providing report results. Viscous attributes and non-viscous may be identified. A smart cube may be received and may include viscous values for the viscous attributes. The smart cube may be stored at a local cache. A report associated with an organization may be initiated. A runtime generation of the report may be generated based on initiating the report. The report may call a viscous attribute from the viscous attributes and call a non-viscous attribute from the non-viscous attributes. The runtime generation may be modified to remove the viscous attribute from the runtime generation. A viscous value for the viscous attribute may be retrieved from the smart cube at the local cache. The modified runtime generation may be executed to retrieve a non-viscous value for the non-viscous attribute from a remote database and a report result may be provided.