The described technology is generally directed towards quasi-listing table entries that facilitate the efficient return of an object list in response to a query for relevant objects in a data storage system. A quasi-listing table entry is created when an object is created, and subsequently converted to a normal listing table entry. A normal listing table entry is converted to a quasi-listing table entry when an object is deleted, with the quasi-listing table entry subsequently deleted. When an object list request is received, a normal listing table entry can be used directly to add to the object list; only if a quasi-listing table entry is encountered (before it can be converted or deleted) does the object table need to be accessed to determine if the object actually exists. This eliminates most object table accesses, including those in remote geographic zones, thereby making object listing significantly more efficient.

Systems and methods include an application programming interface based on a first plurality of object attributes of a data structure, and a framework to update the data structure with a second one or more object attributes and associate the first object type with a first search method. The application programming interface is updated based on the updated data structure, and the framework receives attribute values and the first object type via the updated application programming interface, maps the attribute values to respective ones of the first object attributes and the second object attributes, and identifies and executes the first search method to generate a query of object instances of the first object type.

A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

Systems, devices, computer-implemented methods, and tangible non-transitory computer readable media for performing multilayered generation and processing of computer instructions are provided. For example, a computing device may receive a request with instructions in a first computer language, parse the instructions in the first computer language, analyze the instructions in the first computer language in view of information describing structure of a first application, generate instructions in a second computer language different from the first computer language where the instructions in the second computer language are generated based on the instructions in the first computer language and the information describing structure of the first application, obtain a result from a second application where the result comprises information based on the instructions in the second computing language, and provide the result in response to the request comprising the instructions in the first computer language.

Some embodiments involve a method of connecting, by a computerized system, to a database at a source. The computerized system queries the database for data associated with a characteristic and identifies the data. The computerized system organizes the data into a batch based on business-defined rules. The batch condenses a plurality of rows of data in the database associated with the characteristic into one row of data associated with the characteristic. The computerized system transforms the batch into a packet having a text or binary ready-to-consume format and publishes the packet as a ready-to-consume business object.

A non-transitory computer readable storage medium has instructions executed by a processor to maintain a repository of machine learning directed acyclic graphs. Each machine learning directed acyclic graph has machine learning artifacts as nodes and machine learning executors as edges joining machine learning artifacts. Each machine learning artifact has typed data that has associated conflict rules maintained by the repository. Each machine learning executor specifies executable code that executes a machine learning artifact as an input and produces a new machine learning artifact as an output. A request about an object in the repository is received. A response with information about the object is supplied.

Re-Identification of physical objects in an image background is made possible by the use of temporary data objects (i.e., video cookies). Image data including an image object representing a physical object in at least one of a plurality of backgrounds is pre-stored in a database. Identification data for the image object and image background data is extracted from the image object and a comparison is made to determine if the identification data matches identification data in the database. In the event no match is found, a temporary data object is created and stored in the database that links the identification data and the image background data. If an identification data match is found, it is determined whether a temporary data object exists in the database. If no temporary data object exists, one is created and stored in the database. If a temporary data object is determined to exist in the database, it is determined whether the temporary data object fulfills a predetermined condition(s). If the predetermined condition(s) is not fulfilled, a default action is executed and if the predetermined condition(s) are fulfilled, a specific action is executed.

In one embodiment, a computing device includes a memory device storing instructions, and a processing device communicatively coupled to the memory device. The processing device executes the instructions to execute a computer-implemented system configured to manage items in a self-describing data model, and generate a representation of a federated system in the self-describing data model. The representation includes logical model items having logical model item types associated with data in an external object model used by a third-party computer-implemented system. The processing device may enable communication of the items and the logical model items between a client computer-implemented system and the third-party computer-implemented system.

The present disclosure relates to computer-implemented methods, software, and systems for exchanging metadata between applications. One example method includes providing a metadata service defining a service metadata model for exposing metadata of data objects defined at one or more applications. A connection to a data source associated with a first application is established from a separate application to acquire the metadata from the data source for one or more data objects related to the first application. In response to establishing the connection, a view of content from the data source is provided that includes a list of entities from the service metadata model. A query defined based on the list of entities is received for acquiring metadata associated with the one or more identified entities. The query is evaluated at a backend of the first application and the metadata for the identified entities from the data source is provided.

Techniques for implementing tenancy isolation for entities are disclosed. In some embodiments, a computer system performs operations comprising: compiling a software project having one or more source code files, the source code file(s) comprising entity classes, each one of the entity classes having a corresponding entity class definition comprising a tenancy isolation annotation that is defined in a software library, the compiling of the software project comprising compiling the entity classes; and enhancing the compiled entity classes based on the entity class definitions of the compiled entity classes comprising the tenancy isolation annotation, the enhancing the compiled entity classes comprising adding a tenancy filter to the corresponding entity class definitions of the compiled entity classes, the tenancy filter being configured to apply tenancy isolation to entity instances of the compiled entity classes in a relational database.