Abstract: In accordance with an embodiment, described herein is a system and method for providing extensibility in an analytic applications environment, including a semantic layer that enables the use of custom semantic extensions to extend a semantic data model (semantic model). In accordance with an embodiment, when customizations are made to the semantic model, the system stores changes to the semantic model as an action-set, rather than as a changed-state. This allows the system to replay changes on the factory model, to get back to a desired end state, much as an operating system update does not affect the underling setup.

Abstract: In accordance with an embodiment, described herein is a system and method for providing extensibility in an analytic applications environment, including a semantic layer that enables the use of custom semantic extensions to extend a semantic data model (semantic model). In accordance with an embodiment, the system enables use of a fragmented query model—when customizations are made to the semantic model, the system can dynamically merge the changes from the various deltas when queries are generated at runtime, to dynamically surface appropriate data based on the extended semantic model.

Abstract: Methods, systems, and computer-readable media for distributed transactions across multiple consensus groups are disclosed. A distributed transaction system comprises a proposer and a plurality of consensus groups, including a first consensus group comprising a first plurality of members and a second consensus group comprising a second plurality of members. The proposer proposes a transaction to at least a portion of the first consensus group and at least a portion of the second consensus group. A majority of the members in the first consensus group agree to perform the transaction, where the transaction is selected from a plurality of proposed transactions involving the first consensus group. A majority of the members in the second consensus group also agree to perform the transaction. The members of the first and second consensus groups perform the transaction to update a plurality of stored replicas.

Abstract: The disclosure herein describes a data processing system that enhances its performance based on context of the data to be processed. An input data set is obtained, and a context of the data set is identified based on context metadata. Anomalous data of the data set is identified, and a correction model is applied to the anomalous data to generate corrected data based on the identified context. The data of the input data set, including the corrected data, is extracted to a landing data store. A transformation process of the extracted data is optimized based on the identified context and the optimized transformation process is performed on the extracted data to generate transformed data. The transformed data is loaded into a target data store. The described system is configured to handle anomalous data and optimize transformation processes automatically, which enhances the efficiency and flexibility of the system.

Abstract: This disclosure describes systems and methods for interlinking multiple independent and separately-scalable blockchains to provide transactional provenance. The disclosed systems and methods leverage a combination of blockchain and graph data structures to interoperate between blockchains without requiring a single data structure while still providing a single chain of custody and provenance for a particular set of actions.

Abstract: In some implementations, a monitoring device may obtain information related to one or more extract, transform, and load (ETL) jobs scheduled in an ETL system. The monitoring device may generate ETL job metrics that include status information, timing information, and data volume information associated with one or more constituent tasks associated with the one or more ETL jobs, wherein the ETL job metrics include metrics related to extracting data records from a data source, transforming the data records into a target format, and/or loading the data records in the target format into a data sink. The monitoring device may enable capabilities to create or interact with one or more dashboards to visualize the ETL job metrics via a workspace accessible to one or more client devices. The monitoring device may invoke a messaging service to publish one or more notifications associated with the ETL job metrics via the workspace.

Abstract: Search may be provided using a database storing a plurality of documents comprising a first set of documents and a second set of documents, a set of vetting values and a computer readable medium. In such a system, for each document in the second set of documents, the first set of documents comprises a document for which that document from the second set of documents is identified as a subsequent related document. Additionally, the set of vetting values may comprise, for each document from the second set of documents, a vetting value for the document from the first set of documents for which that document from the second set of documents is identified as the subsequent related document. Additionally, the medium may store instructions to respond to a query by determining, based on the set of vetting values, a search result set comprising documents from the first set of documents.

Abstract: An apparatus includes a memory and a processor. The processor receives a request to validate target data against source data. The processor identifies a disagreement between an element of source data and a corresponding element of target data. The disagreement indicates that the ordered set of alphanumeric characters representing the source element is different from the ordered set of alphanumeric characters representing the target element. In response to identifying the disagreement, the processor determines that the source element does not match the target element, where the source element includes a first value stored according to a first format, and the target element includes a second value stored according to a second format. In response, the processor extracts an element of the source data corresponding to the source element, transforms this element from the first format to the second format, and loads it into the target data.

Abstract: An apparatus and corresponding methods for transforming a data structure is provided. Apparatus may include a processor and a memory communicatively connected to the processor. The memory instructs the processor to receive a plurality of discrete data structures from one or more transportation entities, wherein each of the plurality of discrete data structures comprises a plurality of discrete transport data related to a transport. The memory instructs the processor to generate a unified data structure as a function of the plurality of discrete data structures, wherein the unified data structure comprises unified transport data. The memory instructs the processor to display the unified data structure to a user through a graphical user interface (GUI).

Abstract: Certain aspects of the present disclosure provide techniques for ranking users based on similarity. One example method generally includes receiving a request to view a list of users similar to a user based on personal information and receiving user data generated based on attribute data and financial data associated with the user comprising value data of the user. The method further includes obtaining clusters comprising value data of a plurality of users based on mapped data of the plurality of users and determining, by comparing the value data of the user data with the value data of the clusters, a cluster of vectors similar to the user data. The method further includes generating, based on a list of user identifiers using a distance function, a ranked list of similar users and transmitting the ranked list of similar users to a user device for display.

Abstract: Herein are resource-constrained techniques that plan ahead for resiliently moving pluggable databases between container databases after a failure in a high-availability database cluster. In an embodiment, a computer identifies many alternative placements that respectively assign each pluggable database to a respective container database. For each alternative placement, a respective resilience score is calculated for each pluggable database that is based on the container database of the pluggable database. Based on the resilience scores of the pluggable databases for the alternative placements, a particular placement is selected as an optimal placement that would maximize utilization of computer resources, minimize database latencies, maximize system throughput, and maximize the ability of the database cluster to avoid a service outage.

Abstract: An information search method is provided. The method includes: searching for webpages related to a search request through a search engine; extracting respective texts related to the search request from respective webpages and splicing the texts to obtain a spliced text; obtaining a text segment from the spliced text; and sending the obtained text segment to the search engine, to display the obtained text segment in an information search result through the search engine. The present disclosure can bring great advantages to the search engine in terms of user experience and interaction, and can satisfy user requirements for a function of an intelligent question and answer. Through present disclosure, it is beneficial to directly presenting a short text with higher relevance to the search request to the user, thereby saving time in screening information for the user.

Abstract: Disclosed herein are system, apparatus, article of manufacture, method, and/or computer program product embodiments for providing rolling updates of distributed systems with a shared cache. An embodiment operates by receiving a data item key corresponding to a request from a user profile operating on a media player and receiving a version identifier corresponding to a first version of an application operating on the media player. It is determined that a shared cache includes a first value and second value for the data item key. A key component is generated corresponding to the user profile. Both the generated key component and the data item key are provided to the shared cache, and the first value of the data item as stored in the shared cache is received. The first value of the first version of the data item is updated.

Abstract: A stream computing application may be configured to manage the flow of tuples through a section of an operator graph. A window may be generated over one or more stream operators. The window may include breakpoint thresholds that set the maximum flow of tuples within the window. The stream operators within the window may be monitored to determine the flow of tuples occurring within the window using tuple flow counts. The tuple flow counts may be compared to the breakpoint thresholds to determine whether a breakpoint condition has occurred. If a breakpoint condition has occurred, a tuple flow change may be implemented to reduce the flow of tuples within the window.

Abstract: A request to obtain an identified content item is received. It is determined that the identified content item is stored in a plurality of locations. It is determined to obtain the identified content item from a first storage location storing a first serialized representation of a file system snapshot that includes the identified content item and a second storage location storing a second serialized representation of the file system snapshot that includes the identified content item based on available resources associated with the plurality of locations. The identified content item is extracted from the first serialized representation at the first storage location and from the second serialized representation at the second storage location including building a stubbed tree data structure using the first serialized representation and the second serialized representation. The extracted identified content item is provided using the stubbed tree data structure.

Abstract: The present teaching, which includes methods, systems and computer-readable media, relates to providing query suggestions based on a number of data sources that include person's personal data and non-personal data. The disclosed techniques may include receiving an input from a person, obtaining a first set of suggestions based on a person corpus derived from at least one data source private to the person, obtaining a second set of suggestions based on information from an additional data source, ranking the first and second sets of suggestions to generate a ranked list of suggestions, and presenting at least some of the ranked suggestions.

Abstract: The maintenance of a materialized view created and managed by a materialized view management platform may be dynamically adjusted. The performance of updates to a materialized view are monitored to trigger different events to make adjustments to the performance of subsequent updates. The materialized view management platform can adequately scale to handle changes to data sources as inputs to the maintenance of the materialized view, as well as make other adjustments handle various changes in the capability of the target data store to receive updates to the materialized view (e.g., target data store outages).

Abstract: A relational database system may receive from a client a query that is supported by the relational database system, the relational database system being configured to store a plurality of data objects such that each data object is associated with a respective data table of a plurality of data tables. The system may determine that the query is indicative of a data object type that is associated with data stored in a data system separate from the relational database system. The system may identify a schema of the data object type using a schema record maintained by the relational database system, transmit to the separate data system a request for data associated with the query, receive requested data, and return a query response including the requested data.

Abstract: The described technology is generally directed towards generating content selection graphs in an in-memory content selection graph data store in association with respective start times that indicate when the respective graphs become active. When a content selection graph is needed for a given timepoint, a node identifier is used to obtain response data that is cached for that node identifier and timepoint. Edge data associated with the node identifier is used to determine a next node for obtaining its response data for caching, and so on. The response data can be prebuilt, e.g., generated in a set of active graphs for different client types, so that a response can be returned generally as is from the active graph in the set for the node identifier and that particular client type. For efficiency, operations can be used to avoid processing a node identifier more than once when generating a graph.

Abstract: In some implementations, a device may receive a first data set configuration and a second data set configuration. The device may receive a first set of input data sets based on the first data set configuration and a second set of input data sets based on the second data set configuration. The device may process, by executing a single set of executable code and based on the first data set configuration, the first set of input data sets. The device may process, by executing the single set of executable code and based on the second one or more parameters, the second data set configuration. The device may generate a first output file based on the desired data from the first set of input data sets. The device may generate a second output file based on the desired data from the second set of input data sets.