Abstract: A database system generates an execution plan including multiple operators for processing a database query, for example, a join query or a group by query. The database system allocates a set of threads. Threads communicate with other threads via blocking channels. A blocking channel includes a buffer of a fixed capacity. The database system processes the database query by streaming data through operators of the execution plan. A thread sends data generated by an operator to another thread via the blocking channel if the buffer of the blocking channel has available capacity to store the data, or else the thread blocks until the buffer has capacity to store the data. Similarly, a thread receives data generated by an operator of another thread via the blocking channel if the buffer of the blocking channel has available data, or else the thread blocks until the buffer has data.

Abstract: A database system generates an execution plan including multiple operators for processing a database query, for example, a join query or a group by query. The database system allocates a set of threads. Threads communicate with other threads via blocking channels. A blocking channel includes a buffer of a fixed capacity. The database system processes the database query by streaming data through operators of the execution plan. A thread sends data generated by an operator to another thread via the blocking channel if the buffer of the blocking channel has available capacity to store the data, or else the thread blocks until the buffer has capacity to store the data. Similarly, a thread receives data generated by an operator of another thread via the blocking channel if the buffer of the blocking channel has available data, or else the thread blocks until the buffer has data.

Abstract: In some examples, a system determines whether a chain of functions violates a constraint, based on accessing a tracking structure populated with entries as the functions are invoked by respective server processes launched during execution of a database operation, where each entry of the entries of the tracking structure identifies a respective invoked function that is associated with a corresponding program instance, and detecting, using the tracking structure, related functions that form the chain, the related functions being identified as related if associated with a same program instance. In response to determining that the chain of the functions violates the constraint, the system blocks an invocation of a further function to be added to the chain.

Abstract: Dynamic partitioning of a search space of queries is implemented for flexible, heuristic database querying. Search space partitioning refers to dividing the search space for a submitted query into smaller parts by augmenting the queries to append thereto an additional predicate comprising a dynamic partition key and a value(s) selected based on heuristics (e.g., recency and/or relevancy of the value(s)). A plurality of candidate augmentations of the query and corresponding query plans are generated and evaluated based on additional heuristics to determine which can be executed to yield the best results in terms of result quality and latency. This query plan is selected and executed for retrieval of results that satisfy the query, with pagination utilized for presentation of the results. The procedure of generating candidate query plans, selecting one of the candidates for execution, and paginating results is repeated until a search termination criterion is satisfied.

Abstract: A method and apparatus for better securing databases is provided herein. During a database search, a target of a search (e.g., a person or object) will have a maximum number of allowed searches. When a user performs a search on a target, a determination of how many prior searches on the target object or individual was made. If the number of prior searches exceeds a threshold, then the search will be denied.

Abstract: A computing threat detection rule method and system for performing the method. The method includes determining identifiers for data points. One or more terms for each of the data points are determined to determine terms respectively associated with the identifiers. Collections of identifiers respectively associated with the terms are determined, the number of identifiers in each of the collections of identifiers limited to a threshold number. Conditions of a rule are determined. The conditions of the rule are compared to the terms to determine matching terms respectively associated with corresponding collections of identifiers. An intersection of the corresponding collections of identifiers is determined, and a number of the data points covered by the rule is determined based on the intersection of the corresponding collections of identifiers. A transmission is performed based on the number of the data points covered by the rule.

Abstract: A system and method for hierarchical database operation accelerator for scaling a single node database with a plurality of accelerator cards is provided, including: a host, receiving a query plan, generating a corresponding query operation and distributing them, receiving and processing aggregated execution results; a hierarchy accelerator module, which is connected to the host, receiving the query operation distributed and returning the aggregated execution results; the hierarchy accelerator module comprises a master accelerator card and at least one slave accelerator card, the slave accelerator card returns the execution results to the master accelerator card, by the master accelerator card completes the subsequent query operation which is aggregated and assigned by the execution results, returning the aggregated execution results to the host; the accelerator system having a multi-level storage architecture of accelerator chip on-chip cache, the accelerator card memory, the accelerator card storage, and the

Abstract: Managing record hierarchies and record groups in a data management system is provided. A root record node is identified for a record hierarchy. A probabilistic search of a graph of the record hierarchy is performed to identify record nodes related to the root record node based on record relationships data. Identified record nodes related to the root record node are positioned as a level under the root record node in the record hierarchy. Any record nodes that are not related to the root record node but match a definition of the record hierarchy are identified. It is determined whether a set of record nodes unrelated to the root record node was identified. In response to determining that a set of record nodes unrelated to the root record node was not identified, it is determined that records matching the definition of the record hierarchy are positioned in the record hierarchy.

Abstract: A method is provided where under control of one or more processors configured with executable instructions, the method include receiving a user instruction from a user to perform a search on an electronic device, and identifying a subject matter topic based on the user instruction. The method also includes identifying real time context awareness information related to the user interaction with a resource identified by the electronic device in response to the user instruction, and obtaining additional resources related to the search based on the real time context awareness information related to the user interaction with the resource.

Abstract: A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; and determining a combined rating and a combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items.

Abstract: A system and method to provide adaptively re-ranked search results in response to a search query. An initial ranking of search results associated with a search query cluster including a first search query and a second search query is established. One or more model parameters associated with the first search query are identified. A machine-learning model generates a re-ranking of the search results based at least in part on the initial ranking and the one or more model parameters. In response to receiving the second search query from an end-user system, causing a display of the re-ranking of the search results to the end-user system.

Abstract: Ranking of geographic information includes receiving information about geographic features, identifying documents based on the information, each document being associated with one of the geographic features, and generating a rank score for each document based on one or more properties of the geographic feature associated with the document.

Abstract: A social intelligence system is presented that streams information from a source, queues the streamed information, analyzes/scores the queued data, and stores the analyzed/scored data in an analysis database. The analyzed/scored data can then be retrieved from the database for post-processing and stored in a client specific database for further reporting. By streaming the data into various message queues and scoring the data before storing in the analysis database, large volumes of data can be efficiently processed and analyzed for a particular person and/or entity.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives, from a client device, a request for information associated with a category. In response to the request, the program further accesses a storage to retrieve a first value associated with the category. The program also determines a set of values associated with the category based on a plurality of transactions. The program further determines an optimization level value associated with the category. The program also determines a second value associated with the category based on the first value, the set of values, and the optimization level value. The program further provides, by an application operating on the device, a graphical user interface (GUI) to the client device, the GUI comprising the second value.

Abstract: Systems and methods for automated techniques that generate queryable database table ownership attribution information in real-time. In addition to generating ownership attribution information, system and methods provide a novel framework for creating bi-partite graphs and generating insightful graph data.

Abstract: Provided are a data management method and system for a security protection terminal, a device and a medium. The method includes: respectively generating an initial universally unique identifier for each security protection terminal; determining a target search field, calculating corresponding search field identifier information, and inputting the same into the initial universally unique identifier to obtain a target universally unique identifier; storing data corresponding to the security protection terminals in corresponding sub-databases based on a horizontal partitioning and modulus mode according to the target universally unique identifier; and receiving a data search request, and locating to the sub-databases based on the horizontal partitioning and modulus mode according to the target search field identifier information, thereby facilitating subsequent data search in the sub-databases.

Abstract: In one embodiment, a computer system comprises one or more central processing units (CPUs) that are communicatively coupled to a system clock, one or more network interfaces, and one or more database interfaces; digital electronic main memory that is communicatively coupled to the one or more CPUs and storing one or more sequences of stored program instructions which, when executed using the one or more CPUs, cause the one or more CPUs to execute a plurality of different consumer services of a SaaS-based data analytics platform, each of the consumer services hosting an instance of a sandboxed runtime for a hermetic and deterministic programming language; user function storage that is communicatively coupled to one of the database interfaces and storing a plurality of different user functions, each of the user functions having been programmed using the programming language, each of the user functions being stored in association with a reference to a destination table of a destination database; each of the cons

Abstract: Technology for routing queries in a system with a plurality of nodes (for example online analytical processing sub-systems) where each node has an associated replicated local database and a local latency value and replication velocity values. The workload balancing for incoming received queries among and between the plurality of nodes is based, at least in part, on consideration of latency values and/or replication velocity values for the various nodes. The best node to handle a given query is thereby selected and the query is routed to the selected node for response.

Abstract: Systems and methods for property valuation using automated valuation models are described herein, which involve a complex series of workflows for data processing, automated valuation modeling, and error detection—each of which are capable of leveraging machine learning algorithms/techniques and can be combined and operated together in a specific manner in order to improve data availability and data quality, improve the accuracy of generated property value estimates, improve the performance of the models over time, and allow the property value estimation to be adapted to various use cases. Estimation of property value may involve an ensemble model which reconciles the outputs of different sub-models based on a use case, with the sub-models using different approaches that have their own strengths and weaknesses.

Abstract: Disclosed are methods and computer systems to generate, update, traverse, and analyze a nodal data structure based on data associated with an entity. The methods and systems disclosed herein describe a server that can generate and link various nodes in a nodal network and parse data into unique data tables. The server then displays a web document having a set of words where each word corresponds to a data table. When a user interacts with a word within the web document, the server identifies a set of nodes associated with the word with which the user has interacted. The server then executes one or more analytical protocols using the identified nodes and displays the results.

Abstract: Methods, systems, and computer-readable media are described in which WAL records are replayed serially at the database sub-object level, thereby enabling parallelism for processes affecting a single database object without interfering with the consistency required to maintain ROS capability. WAL records are replayed serially at the B-Tree branch level, instead of existing approaches which serialize WAL record replay at the object or block level. Described examples may thereby enable multi-block operations (e.g., SPLIT) within the same B-Tree branch to be replayed in the correct sequence, thereby maintaining consistent reads during ROS. Multi-level dispatching at the object and sub-object levels may be used to minimize delays caused by operations affecting multiple branches of a database object.

Abstract: A method and device for storing data in a distributed database according to a row storage mode and a column storage mode, respectively, the method including: when a change is detected in the data in the row storage mode, obtaining the target row data that has changed based on a preset synchronization policy; determining the number of original data copies and the number of redundant data copies based on the attribute information and the number of failure-resistant nodes of the target row in which the target row data is located; coding the target row data in accordance with a predetermined corrective coding algorithm based on the number of original data copies and the number of redundant data copies, generating coded data; and distributing each copy of the coded data equally by column or group of columns to different nodes in the distributed database for storage.

Abstract: The present application provides a method for cross-node cloning of a storage volume, a device, apparatus and a storage medium. The method includes: creating AEP storage in a node of a cluster by using pmem-csi, and monitoring whether a clone volume of the AEP storage exist in other nodes of the cluster, in response to that a clone volume of the AEP storage is monitored in the other nodes of the cluster, stopping the AEP storage and the clone volume; creating a snapshot of the AEP storage, and recovering the AEP storage; and starting the clone volume after transmitting snapshot data of the AEP storage to the clone volume. By using the solution of the present application, the problem of performing application migration and data backup of an AEP storage volume used in a cloud platform may be solved.

Abstract: Systems, computer program products, and methods are described herein for synchronizing dataflow migration between technical environments. The present invention is configured to identify one or more resources in a source environment for migration from the source environment to a target environment; capture, using a resource assessment engine, one or more dependencies associated with the one or more resources; generate a migration load based on at least the one or more resources identified in the source environment and the one or more dependencies associated with the one or more resources; generate a snapshot of the source environment based on at least the migration load, wherein the snapshot comprises at least the one or more resources and the one or more dependencies; and store the snapshot of the source environment in a snapshot database repository.

Abstract: A system may include a plurality of systems of record (SORs) each including a local SOR database(s) configured to store information corresponding to local SOR identities, a change monitor service configured to detect updates to the local SOR database(s), and a transactor node configured to receive the updates from the change monitor service, communicate the updates to other transactor nodes of other SORs, and receive updates from the other transactor nodes for non-local SOR entities. Each SOR may also include a domain cache configured to store the updates received by the transactor node as an immutable list of updates to the local and non-local SOR entities over time, and a synchronization service cooperating with the domain cache to determine updates to non-local SOR identities that correspond to local SOR identities and update the local SOR database(s) based thereon.

Abstract: Disclosed is a method for an intermediary mapping an de-identification comprising steps of retrieving datasets and meta data from a data source; selecting a target standard; mapping the retrieved datasets and the metadata to the target standard, wherein the datasets and the metadata are mapped to the target standard using one of, a schema mapping, a variable mapping, or a combination thereof; infer one or more of, variable classifications, variable connections, groupings, disclosure risk settings, and de-identification settings using the dataset mapping and metadata; perform a de-identification propagation using the mapped datasets, the mapped metadata, the inferred variable classifications, the inferred variable connections, the inferred groupings, the inferred disclosure risk settings, the inferred de-identification settings, or a combination thereof.

Abstract: Systems and methods for transforming a data visualization are disclosed. An example method includes presenting the data visualization on a first page of a display of the computing device, the data visualization representing at least a first portion of a data set, receiving a visualization transformation command from a user, in response to receiving the visualization transformation command, navigating to a second page of the display, and, during the navigation, transforming the data visualization based at least in part on the first portion of the data set, wherein the transformation includes at least enlarging the data visualization and rotating the data visualization from a first orientation to a second orientation.

Abstract: A visual-based classification model influenced by text features as a result of the outputs of a text-based classification model is disclosed. A system receives one or more documents to be classified based on one or more visual features and provides the one or more documents to a student classification model, which is a visual-based classification model. The system also classifies, by the student classification model, the one or more documents into one or more document types based on one or more visual features. The one or more visual features are generated by the student classification model that is trained based on important text identified by a teacher classification model for the one or more document types, with the teacher classification model being a text-based classification model. Generating training data and training the student classification model based on the training data are also described.

Abstract: A system and method for a multi-stage approach for creating topic models is presented. The method includes applying a first stage topic model to textual data, wherein the first stage topic model is trained to discover a first plurality of topics and distributions of words in each topic of the first plurality of topics from the textual data; generating at least one seeded word for a subset of topics of the first plurality of topics, wherein the at least one seeded word is determined based on a plurality of selection rules and the distributions of words in the subset of topics discovered in the first stage topic model; and creating a second stage topic model by feeding the generated at least one seeded word to direct identification of the subset of topics of the first plurality of topics.

Abstract: Described herein are techniques that may be implemented by a computerized system for parsing contracts using natural language understanding and/or textual analytics rules and determining whether a party to a contract is compliant with insurance coverage identified by the contract. Some techniques described herein can create structured data from unstructured contract text describing insurance coverage that a party to a contract is required to hold. Some such techniques including comparing the structured data indicating required coverages (which was determined from the unstructured text) to other structured data indicating coverages held by a party, to determine whether the coverage held by the party satisfies the required coverages. In some embodiments, a system implementing these techniques output whether coverage is missing or otherwise insufficient, or whether the coverages held by a party satisfy required coverages of the contract.

Abstract: A virtual assistant server extracts concept(s) from a received user query and correlates the extracted concept(s) to a plurality of nodes in a knowledge graph to identify qualifying path(s) in the knowledge graph. Further, when the two or more qualifying paths are identified, the virtual assistant server addresses one or more ambiguities in the knowledge graph by: prompting the user device to resolve a current one of the one or more ambiguities progressing from contextual nodes towards leaf nodes in the knowledge graph; receiving a response to the prompt from the user device; and repeating the prompting and the receiving until each of the one or more ambiguities is resolved and a matching path to the received query is identified. Finally, the virtual assistant server outputs content associated with a leaf node of the matched path to the user device.

Abstract: According to one embodiment, a CPU generates, based on a tone-marked pinyin search character string containing a wildcard “?” and acquired from a communication terminal, a tone-number-added pinyin search character string for wildcard search in which “0” is added to a character having no tone number (i.e., an alphabetical letter representing a consonant) and a tone number wildcard “?” is added to a position immediately after the existing wildcard “?”. The CPU also generates a tone-number-added pinyin entry word character string for wildcard search, by adding “0” to a character having no tone number in a tone-number-added pinyin entry word character string corresponding to a Chinese-Japanese dictionary entry word that matches a tone-number-omitted pinyin search character string. The CPU then compares the tone-number-added pinyin search character string for wildcard search with the tone-number-added pinyin entry word character string for wildcard search to determine if they match each other.

Abstract: Aspects of the present disclosure involve a system comprising a computer-readable storage medium storing a program and method for mapping webpages to page groups. The program and method provide for receiving plural Uniform Resource Locators (URLs), each URL of the plural URLs corresponding to a respective webpage of a website; generating a distance matrix with pairwise distances between the plural URLs; performing hierarchical clustering based on the distance matrix, to generate a dendrogram in which the plural URLs are arranged in hierarchical clusters; and determining, based on the dendrogram, a predicted page group for each of the plural URLs.

Abstract: A set of nodes organized in a logical tree structure is obtained, where the set of nodes represent objects in a user interface. A first set of rankings is generated for the set of nodes, where the first set of rankings indicate likelihoods of nodes of the set of nodes corresponding to a first classification. A first node from the set of nodes that corresponds to the first classification is identified based at least in part on the first set of rankings. A second set of rankings that indicate likelihoods of descendent nodes of the first node corresponding to a second classification different from the first classification is determined. A second node from the descendent nodes that corresponds to the second classification is identified based at least in part on the second set of rankings. Data from an object in the user interface that corresponds to the second node is obtained.

Abstract: In one embodiment, a device obtains an ontology derived from a data usage restriction document and indicative of a category of protected data. The device obtains metadata indicative of a type of data handled by an application. The device creates a mapping between the type of data handled by the application and the category of protected indicated by the ontology. The device generates, based on the mapping, a data compliance manifest used by a workload engine to constrain use of the type of data during execution of the application or used to constrain use of the type of data during deployment of the application.

Abstract: This application relates to a method for recommending a cold start object performed by a computer device. The method includes: obtaining a content feature and an initial preference feature that are of a target object in a cold start state; performing multilayer perceptron processing on the content feature based on a meta-mapping network to obtain a feature mapping relationship matching the target object; performing a mapping transformation on the initial preference feature according to the feature mapping relationship, to obtain an updated preference feature close to a target preference feature spatial distribution; and performing recommendation analysis on the target object based on the updated preference feature, to obtain a recommendation result for the target object.

Abstract: A method for searching for a clipping template includes: in a video editing scenario, a server device acquires a first multimedia resource specified by a user and carries out searching according to the first multimedia resource specified by the user, to obtain a target clipping template matching the first multimedia resource, the target clipping template being used to indicate that multimedia material to be clipped is clipped, on the basis of a target clipping method, into a second multimedia resource.

Abstract: A system and method for multi-media content bookmarking with provenance supplements multi-media content captured by media recording devices used or carried by a police officer during the course of his/her duties with information inputted by the police officer, wherein the added information is in the form of metadata. In at least one embodiment, a user interface (UI) tool for inputting the supplemental metadata is the source of provenance for the metadata, and the supplemental metadata is tagged to the captured content in a manner that preserves the provenance of the captured content. In a further embodiment, the user interface further enables the officer to create an affidavit as to the veracity of the supplemental metadata. The supplemental metadata may be stored in conjunction with the captured multi-media content in a secure data storage, but the content itself is not altered, thereby maintaining provenance of the content.

Abstract: A method for automated routing of pictures taken on mobile electronic devices to a digital picture frame including a camera integrated with the frame, and a network connection module allowing the frame for direct contact and upload of photos from electronic devices or from photo collections of community members. Clustering photos by content is used to improve display and to respond to photo viewer desires. Trends or patterns can be detected from the photo collections and that information used for various purposes beyond photo display.

Abstract: Methods, systems, and apparatus for receiving a request that includes a user identifier of a user that submitted a search query and an entity identifier of an entity that is referenced by the search query, identifying a plurality of knowledge elements that are related to the entity, identifying, in a consumption database, one or more items that have been indicated as consumed by the user and that are associated with the entity that is referenced by the search query, assigning rank scores to the plurality of knowledge elements, based at least on identifying the one or more items, selecting one or more of the knowledge elements from among the knowledge elements based at least on the rank scores assigned to the knowledge elements, and providing, in response to the request, information associated with the entity and the one or more selected knowledge elements.

Abstract: Described are systems and methods to determine hair patterns presented in content items. The determined hair patterns may be associated with the content items to facilitate indexing, filtering, etc. of the content items based on the determined hair patterns. In exemplary implementations, a corpus of content items may be associated with an embedding vector that includes a binary representation of the content item. The embedding vectors associated with each content item can be provided as inputs to a trained machine learning model, which can process the embedding vectors to determine one or more hair patterns presented in each content item while eliminating the need for performing image pre-processing prior to determination of the hair pattern(s) presented in the content item.

Abstract: Systems and methods are provided for searching one or more sources of digital assets in dependence on one or more keywords. The server node includes logic to identify initial results from the searching of one or more sources of digital assets. The initial search results are accessible by any client node participating in a collaboration session. The server node includes logic to receive an identification of a particular digital asset from the initial results. The server node includes logic to further search the one or more sources of digital assets in dependence on the identified particular digital asset to obtain further results. The server node includes logic to curate the further results as digital assets in a workspace that is accessible in the collaboration session. The digital assets can be curated into separate canvases within the workspace in dependence on at least one criterion.

Abstract: A method of searching for similar products using a multi-task learning (MTL) model is provided. The method includes: converting, by using a multi-task learning model utilizing a unified backbone network, each of an original image including a fashion item into a single vector including at least one multi-task attribute; and generating a visual search database by storing the original image and the single vector of the original image together.

Abstract: Systems, methods, devices, media, and computer readable instructions are described for local image tagging in a resource constrained environment. One embodiment involves processing image data using a deep convolutional neural network (DCNN) comprising at least a first subgraph and a second subgraph, the first subgraph comprising at least a first layer and a second layer, processing, the image data using at least the first layer of the first subgraph to generate first intermediate output data; processing, by the mobile device, the first intermediate output data using at least the second layer of the first subgraph to generate first subgraph output data, and in response to a determination that each layer reliant on the first intermediate data have completed processing, deleting the first intermediate data from the mobile device. Additional embodiments involve convolving entire pixel resolutions of the image data against kernels in different layers if the DCNN.

Abstract: This disclosure relates to systems, methods, and computer readable media for performing filtering of computer vision generated tags in a media file for the individual user in a multi-format, multi-protocol communication system. One or more media files may be received at a user client. The one or more media files may be automatically analyzed using computer vision models, and computer vision generated tags may be generated in response to analyzing the media file. The tags may then be filtered using Natural Language Processing (NLP) models, and information obtained during NLP tag filtering may be used to train and/or fine-tune one or more of the computer vision models and the NLP models.

Abstract: A method includes obtaining first data representing a subterranean domain, and creating a geotag associated with a three-dimensional location of interest in the subterranean domain and a feature at the location of interest. The geotag is further associated with second data that describes the location of interest in the subterranean domain. The method also includes generating metadata describing a portion of the first data, the second data, or both, storing the geotag in a database including a plurality of geotags. The method may also include searching for an analog to the geotag.

Abstract: In some embodiments, an electronic device receives, via one or more input devices, an input corresponding to a request to search content available on the electronic device, wherein the input includes one or more search terms. In some embodiments in response receiving the input corresponding to the request to search content available on the electronic device, an electronic device displays, via a display device, one or more representations of one or more search results including a first representation of a first search result, wherein the first search result is a first content item that is associated with a first transcript of dialog included in the first content item, and the first search result is included in the one or more search results as a result of a relationship between the one or more search terms and the first transcript for the first content item.

Abstract: A method includes obtaining first data including a first identifier of a first product determine in association with a content item based on first metadata of the content item. The method further includes obtaining a first confidence value associated with the first product and the content item. The method further includes obtaining second data including a second identifier of the first product and a second confidence value. The method further includes providing the first data and the second data to a trained machine learning model. The method further includes obtaining a third confidence value from the trained machine learning model associated with the first product. The method further includes adjusting second metadata of the content item in view of the third confidence value.

Abstract: A method of storing semi-structured data includes receiving user data from a user of a query system where the user data includes semi-structured user data. The method also includes receiving an indication that the semi-structured user data fails to include a fixed schema. In response to the indication that the semi-structured user data fails to include the fixed schema, the method further includes parsing the semi-structured user data into a plurality of data paths and extracting a data type associated with each respective data path of the plurality of data paths. The method additionally includes storing the semi-structured user data as a row entry in a table of a database in communication with the query system wherein each column value associated with the row entry corresponds to a respective one of the plurality of data paths and the data type associated with the respective data path.

Abstract: Operating a microservices registry hub that automatically discovers and sorts services. A microservice architecture application includes a plurality of services, the plurality of services are each an application program interface (API) performing a piecemeal function of an overall application function. The microservices registry hub stores an index of the services. The microservices registry hub is configured to enable consumption of services in execution environments. The service hub uses observation agents to monitor particular execution environments and generate a list of unsorted service data associated services available within that environment. That list is automatically pre-sorted based on a predetermined set of heuristic rules based on the index of the plurality of services. An administrator later goes through the pre-sorted service data and confirms whether or not that pre-sorting was correct.