G06F16/86

Management of tasks

A method, computer program and apparatus is disclosed. The method, performed by one or more processors, may comprise receiving, from one or more predetermined organizations, datasets representing entities and datasets representing one or more tasks for those entities and storing in a database, in accordance with an ontology which is common to the organizations, the received one or more datasets as data objects, the ontology defining properties of data objects and relationships between the data objects. The method may also comprise mapping the data objects stored in the database to the organization from which the one or more datasets were received and receiving, through a querying application, a query from a user of one of the predetermined organizations to view one or more data objects relating to a task. The method may also comprise identifying the organization to which the user is associated, generating, based on the mapping, a view including at least the one or more task data objects associated with the identified organization and not data objects associated with other organizations and displaying the view on a user interface.

Data subscription management system

A method includes a digital subscription management system (DSMS) receiving from a source system a request to perform an edit of at least one data object, the DSMS sending a request for response (RFR) to subscribing systems having a copy of the at least one data object, the DSMS receiving a response from the subscribing systems, and the DSMS performing the edit.

LDAP query optimization with smart index selection

The present disclosure relates generally to Lightweight Directory Access Protocol (LDAP), and more particularly, to techniques for improving query performance on an LDAP server. One particular technique includes receiving a LDAP query having search criteria, identifying one or more search filters within the search criteria, determining candidate indices based on the identified one or more search filters, evaluating the candidate indices based on statistics collected for the candidate indices, selecting one or more indices from the candidate indices based on the evaluating, and executing the LDAP query on an LDAP directory using the selected one or more indices.

Mechanism for Deprecating Object Oriented Data
20180004794 · 2018-01-04 ·

Techniques are described to allow the deprecation of classes in an object-oriented data model, such as a CDM for a CMDB. When a class is deprecated and replaced by another existing or new class, data associated with instances of the deprecated class may be migrated to the replacement class. A mapping between the deprecated class and its replacement class may be provided to allow existing applications to continue to access data using the deprecated class without change until the deprecated class is finally deleted or the application is updated to use the replacement class. New applications written to use the object-oriented data model after the deprecation may use the replacement class to access data instances created using the original data model.

SEMANTIC DATABASE DRIVEN FORM VALIDATION

Embodiments of the present invention provide a means for validating electronic forms using one or more semantic databases. The invention includes processing an electronic form into individual elements and generating entities for the individual elements. The closest matching ontology is found for each entity and the pairings are grouped into a general formal ontology tree. The entities in the general formal ontology tree are traversed using generated rules. This analysis yields validation results that are combined with the original form to create an annotated form.

STORING SEMI-STRUCTURED DATA
20230004598 · 2023-01-05 · ·

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing semi-structured data. One of the methods includes maintaining a plurality of schemas; receiving a first semi-structured data item; determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas; and in response to determining that the first semi-structured data item does not match any of the schemas in the plurality of schemas: generating a new schema, encoding the first semi-structured data item in the first data format to generate the first new encoded data item in accordance with the new schema, storing the first new encoded data item in the data item repository, and associating the first new encoded data item with the new schema.

Storage of Data Objects with a Common Trait in a Storage Network
20230229557 · 2023-07-20 · ·

A method includes identifying an independent data object of a plurality of independent data objects for retrieval from dispersed storage network (DSN) memory. The method further includes determining a mapping of the plurality of independent data objects into a data matrix, wherein the mapping is in accordance with the dispersed storage error encoding function. The method further includes identifying, based on the mapping, an encoded data slice of the set of encoded data slices corresponding to the independent data object. The method further includes sending a retrieval request to a storage unit of the DSN memory regarding the encoded data slice. When the encoded data slice is received, the method further includes decoding the encoding data slice in accordance with the dispersed storage error encoding function and the mapping to reproduce the independent data object.

User interface for managing extended schemas

Implementations generally relate to extended schemas. In some implementations, a method includes displaying a first extensible markup language schema definition (XSD) schema, where the first XSD schema includes a plurality of XSD elements arranged in a tree structure. The method further includes receiving a selection of at least one XSD element of the plurality of XSD elements. The method further includes displaying one or more XSD extension selections associated with the at least one XSD element. The method further includes receiving at least one XSD extension selection of the one or more XSD extension selections. The method further includes appending in the tree structure at least one XSD extension element based on the at least one XSD extension selection.

Guided information viewing and storage features within web browsers
11704475 · 2023-07-18 ·

The present disclosure relates to non-transitory computer readable mediums (CRMs) for guided-viewing of annotations and the process or organizing and connecting annotations of web documents within web browsers. The rationale for creating and using such computer readable medium is discussed in detail within this disclosure. Throughout the course of this explanation, various steps are dissected and explained in detail in the context of exemplary embodiments to elaborate on the relevant data structures and the architectures, messaging patterns, and use cases that provide the context for these data structures.

Artificial Intelligence (AI) Framework to Identify Object-Relational Mapping Issues in Real-Time

Various aspects of this disclosure relate to determining mapping issues in object relational mapping (ORM). An artificial intelligence (AI) model may be trained to identify errors in mapping between relational databases and objects during code compilation. Multiple AI models may be used, with different models being associated with different programming frameworks, thereby making this technique framework agnostic.