Patent classifications
G06F16/2272
System and Method for Accommodations Approval
Disclosed is a system and method for allowing an organization to manage and approve requests for accommodations. The system is advantageously used, for example, by employees within an organization who may be making work related travel plans. The system allows the organization to approve and keep track of such travel, while also ensuring that the accommodations being booked are consistent with company policies, previously received RFPs, and prevailing market rates.
Multi-tenant knowledge graph databases with dynamic specification and enforcement of ontological data models
A system and method for a high-performance, scalable, multi-tenant, dynamically specifiable, knowledge graph information storage and utilization. The system uses an in-memory associative array for high-performance graph storage and access, with a non-volatile distributed database for scalable backup storage, a scalable, distributed graph service for graph creation, an indexing search engine to increase searching performance, and a graph crawler for graph traversal. One or more of these components may be in the form of a cloud-based service, and in some embodiments the cloud-based services may be containerized to allow for multi-tenant co-existence with no possibility of data leakage or cross-over.
METHOD AND EQUIPMENT FOR LOGGING, RECORDING AND STORING DATA ON THE TIME OF BIRTH AND LIFE EVENTS OF A USER
The group of inventions concerns a method and equipment for logging, recording data that comprises the time and date of birth of a person, and storing the data throughout the life of a person using a world time and location of birth. The method of logging, recording and storing the user's birth time and life events data includes logging the user's birth time, recording the user's birth time by entering the data into the electronic data logger, linking user birth time to world time and location of user birth, triggering user life time measurement in seconds or minutes or hours or days of planet Earth, taking into account standard world time, transmission of user birth time data from the data logger to the server storage, integration of user data with data of other users, creating links with data of other users, display of user life time information on the interface of the electronic device, recording of user life events time and transmission of user life events data from the data logger to the server storage, display of user life event information on the interface.
MANAGEMENT OF INDEXED DATA TO IMPROVE CONTENT RETRIEVAL PROCESSING
The present disclosure relates to processing operations configured to uniquely utilize indexing of content to improve content retrieval processing, particularly when working with large data sets. The techniques described herein enables efficient content retrieval when working with large data sets such as those that may be associated with a plurality of tenants of a data storage application/service. Among other technical advantages, the present disclosure is applicable to train a classifier using relevant samples based on text search in tenant-specific scenarios, where accurate searching can be executed for content associated with one or more tenant accounts of an application/service concurrently in milliseconds even in instances where there may be millions of documents to be searched. As an example, exemplary data shards may be generated and managed for efficient and scalable content retrieval processing including training of a classifier (e.g., artificial intelligence classifier) and real-time (or near real-time) query processing.
Object Scriptability
Object scriptability includes receiving a high-level language script describing at least one data-analysis object, including a node representing the data-analysis object in a graph-based data structure including a plurality of nodes, where each node from the plurality of nodes represents a respective data-analysis object in a data analysis system, where each node from the plurality of nodes is connected to at least one other node from the plurality of nodes by an edge, and where the edge represents a relationship between the respective objects in the data analysis system.
Index splitting in distributed databases
In a distributed database, many nodes can store copies, or instances, of the same record. If the record is split on one node, it should be split on the other nodes to maintain consistency, concurrency, and correctness of the data in the distributed database. In some distributed databases, the records are locked during the update process to ensure data integrity. Unfortunately, locking the records can increase latency, especially for larger databases. But if the records aren't locked and a node fails as a record is being split and updated simultaneously, the split and update may not propagate throughout the distributed database, leading to a loss of data integrity. Exchanging messages about the status of record splitting and forwarding updates internally reduces the likelihood of a loss of data integrity due to a node failure.
DATA PROCESSING METHOD, APPARATUS, AND DEVICE, COMPUTER-READABLE STORAGE MEDIUM, AND COMPUTER PROGRAM PRODUCT
This application provides a federated-learning-based data processing method, apparatus, and device, and a computer-readable storage medium. The method includes obtaining data to be processed, the data to be processed comprising multiple object identifiers and a feature value corresponding to each object identifier; binning the data to be processed based on the feature value corresponding to each object identifier to obtain a number of bins; determining multiple target identifier sets from each bin, and transmitting each target identifier set to a label-party device; receiving each piece of set label distribution information corresponding to each target identifier set from the label-party device, and determining bin label distribution information corresponding to each bin based on each piece of set label distribution information; and merging bins based on a binning policy and each piece of bin label distribution information to obtain a final binning result.
Machine learning worker node architecture
A database contains a corpus of incident reports, a machine learning (ML) model trained to calculate paragraph vectors of the incident reports, and a look-up set table that contains a list of paragraph vectors respectively associated with sets of the incident reports. A plurality of ML worker nodes each store the look-up set table and are configured to execute the ML model. An update thread is configured to: determine that the look-up set table has expired; update the look-up set table by: (i) adding a first set of incident reports received since a most recent update of the look-up set table, and (ii) removing a second set of incident reports containing timestamps that are no longer within a sliding time window; store, in the database, the look-up set table as updated; and transmit, to the ML worker nodes, respective indications that the look-up set table has been updated.
Systems and methods for centralization of server initialization information
Methods and systems for resource usage tracking are disclosed. In one embodiment, an exemplary method comprises maintaining, in a data store, a configuration file associated with a virtual server instance; instantiating a virtual server based on the virtual server instance by: locating, in the data store, the configuration file; determining required virtual server resources based on the contents of the configuration file; configuring at least one resource of the virtual server based on the contents of the configuration file; and spinning up the virtual server. The method may also comprise determining that an instantiated virtual server has reached an error state; and based on the determination that the instantiated virtual server has reached an error state, determining a configuration file associated with the instantiated virtual server; and instantiating a new virtual server using the determined configuration file.
SYSTEMS AND METHODS FOR DETERMINING THE SHAREABILITY OF VALUES OF NODE PROFILES
The present disclosure relates to determining the shareability of values of node profiles. Record objects and electronic activities of a system of record corresponding to a data source provider may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Values of fields corresponding to a predetermined type of field including fewer than a predetermined threshold number of data source providers may be identified. A restriction tag used to restrict populating other node profiles may be generated. Provision of the value with a second data source provider may be restricted.