Abstract: In accordance with an embodiment, described herein are systems and methods for providing direct access to a sharded database. A shard director provides access by software client applications to database shards. A connection pool (e.g., a Universal Connection Pool, UCP) and database driver (e.g., a Java Database Connectivity, JDBC, component) can be configured to allow a client application to provide a shard key, either during connection checkout or at a later time; recognize shard keys specified by the client application; and enable connection by the client application to a particular shard or chunk. The approach enables efficient re-use of connection resources, and faster access to appropriate shards.

Abstract: Systems and methods generate browse node pages. A combination of a category and one or more aspects is identified by analyzing historical user behavior data associated with a network-based system. A determination is made regarding whether existing browse node pages for the network-based system includes a browse node page for the identified combination. Each browse node page for the network-based system is accessible by a respective uniform resource location (URL) and provides a grouping of items in a respective category with one or more respective aspects. Based on a determination that a browse node page does not exist for the identified combination of the category and the one or more aspects, a browse node page for the identified combination is generated. The generated browse node page corresponds with a URL and provides items matching the identified combination of the category and the one or more aspects.

Abstract: A method, apparatus, and system for modifying user datasets to support statistical resemblance is described. To support modifying user datasets to support statistical resemblance, an application may generate a first profile from a first corpus that includes first user data, generate a set of modified profiles from a second profile from a second corpus including second user data, wherein the first profile and the set of modified profiles includes respective sets of first and second attributes corresponding to one or both of text or metadata associated with the respective first and second user data, determine a mathematical distance between the first profile and each modified profile of the set of modified profiles based at least in part on a comparison between the first set of attributes and the second set of attributes, and finally, select a modified profile having a smallest determined mathematical distance.

Abstract: A mechanism is provided in a data processing system to implement an annotator for annotating content using context-based surface forms. The mechanism receives a dictionary data structure of surface forms comprising a plurality of regular expressions and input content. The mechanism compares a given span of text in the input content to each regular expression in the dictionary data structure. Responsive to the given span of text matching a given regular expression, an annotator annotates the span of text with a content indicator corresponding to a content category associated with the dictionary data structure. The mechanism performs a natural language processing operation on the input content based on results of the annotation.

Abstract: Techniques for reducing data log recovery time and metadata write amplification when checkpointing a data log of a storage object in a distributed storage system are provided. In one set of embodiments, a node of the system can determine whether the data log has reached a first threshold size, where the data log comprises a plurality of data log records, and where each data log record includes data and metadata for a write request directed to the storage object. If the data log has reached the first threshold size, the node can copy, from each of the plurality of data log records, the metadata for the write request to a corresponding metadata log entry in a metadata log of the storage object. The node can then truncate the data log by removing the plurality of data log records.

Abstract: The present disclosure describes a system, method, and computer program for converting natural language queries to structured database queries, including nested database queries. In response to receiving a natural language query for a database, an NLU model is applied to the query to identify an intent and entities associated with the query. The entities are tagged with an entity type that enables the system to identify any database object names, candidate query fields, operands, and contextual entities in the query. From the tagged entities, the system identifies one or more valid explicit, implicit, and indirect references to database objects in the user query. If there is only one valid reference to a database object in the user's query, the system proceeds with steps to create a single-object query. If there are valid references to two or more database objects in the query, the system proceeds with steps to create a nested database query.

Abstract: The present disclosure describes a system, method, and computer program for converting a natural language query to a structured database query. In response to receiving a natural language query for a database, an NLU model is applied to the query to identify an intent and entities associated with the query. The intent is mapped to a database object, and candidate query fields and operands are identified from the entities. The candidate query fields and operands are evaluated to identify any subject fields, conditional expressions, record count limit, and ordering/sorting criteria for the query. This including matching certain query fields and operands based on query parameters, operand types, and locations of operands relative to query fields. A query plan is created based on the evaluation of the candidate query fields and operands, and a database query is generated from the query plan.

Abstract: A method for execution by a query processing module includes determining a query expression indicating a query for execution. An operator tree is generated based on a nested ordering of a plurality of operators indicated by the query expression. Conjunctive normal form (CNF) conversion cost data is generated based on the operator tree, and disjunctive normal form (DNF) conversion cost data is also generated based on the operator tree. Conversion selection data is generated based on the CNF conversion cost data and the DNF conversion cost data. The conversion selection data indicates a selection to perform either a CNF conversion or a DNF conversion. A normalized query expression is generated by performing either the CNF conversion or the DNF conversion upon the query expression based on the conversion selection data. Execution of the query is facilitated in accordance with the normalized query expression.

Abstract: A method and system of data deduplication for data streams in a multi-tenant system. The method receives, at a data accuracy manager, an event from an activity tracking component, determine whether the event is recorded in a probabilistic model that tracks previously received events from the activity tracking component, where the probabilistic model can accurately identify the event has not been previously received with a possible false positive response where the event has been previously received, determines whether information for the event is stored in a metric storage, where the metric storage is a database of metrics derived from the previously received events, and discards the event in response to determining that the event is recorded in the probabilistic model and in the metric storage.

Abstract: Systems and methods for efficient association of related entities. The method may comprise accessing a database of records, using a processor, to identify a set of unoptimized entities represented by one or more nodes in a graph model, a connection between a first node and a second node in the one or more nodes representing an association between a first entity represented by the first node and a second entity represented by the second node; determining the first entity is unoptimized; and determining a set of related entities for the unoptimized first entity in the graph model, the graph model having at least one common entity with a corresponding label model.

Abstract: A method of identifying relationships between data collections is disclosed. Each data collection comprises a plurality of data records made up of data fields. The method comprises performing a relationship search process based on a first seed value and a second seed value. A first set of records from the data collections is identified based on the first seed value. A second set of records from the data collections is identified based on the second seed value. The process then searches for a common value across the first and second record sets, wherein the common value is a value which appears in a first field in a first record of the first record set and in a second field in a second record of the second record set, wherein the first record is from a first data collection and the second record is from a second data collection.

Abstract: Disclosed are a framework and method for selecting an anomaly detection method for each of a plurality of class of time series based on characteristics a time series example that represents an expected form of data. The method provides classification of a given time series into one of known classes based on expected properties of the time series, filtering the set of possible detection methods based on the time series class, evaluating the remaining detection methods on the given time series using the specific evaluation metric and selecting and returning a recommended anomaly detection method based on the specific evaluation metric.

Abstract: Aspects described herein may relate to a transaction exchange platform using a streaming data platform (SDP) and microservices to process transactions according to review and approval workflows. The transaction exchange platform may receive transactions from origination sources, which may be added to the SDP as transaction objects. Microservices on the transaction exchange platform may interact with the transaction objects based on configured workflows associated with the transactions. Processing on the transaction exchange platform may facilitate clearing and settlement of transactions. Some aspects may provide for dynamic and flexible reconfiguration of workflows and/or microservices. Other aspects may provide for data snapshots and workflow tracking, allowing for monitoring, quality control, and auditability of transactions on the transaction exchange platform.

Abstract: Aspects described herein may relate to a transaction exchange platform using a streaming data platform (SDP) and microservices to process transactions according to review and approval workflows. The transaction exchange platform may receive transactions from origination sources, which may be added to the SDP as transaction objects. Microservices on the transaction exchange platform may interact with the transaction objects based on configured workflows associated with the transactions. Processing on the transaction exchange platform may facilitate clearing and settlement of transactions. Some aspects may provide for dynamic and flexible reconfiguration of workflows and/or microservices. Other aspects may provide for data snapshots and workflow tracking, allowing for monitoring, quality control, and auditability of transactions on the transaction exchange platform.

Abstract: Data investigations are performed by querying a plurality of data sources. A system receives an investigation input and queries a plurality of data sources in accordance with the received input. The system receives, in response to the querying, response data from the plurality of data sources, and generates and stores a data structure representing relationships between the first investigation input and the first response data. The data structure may be in the form of a knowledge graph. The system may generate and display a visualization of the data structure. The system may generate and store a record of investigation steps used to generate the data structure, such that the investigation steps may be applied in future instances, for example using different inputs, to generate new data structures.

Abstract: A computer-implemented method and a related system for record linkage of an incoming record to a reference data set may be provided. The method comprises providing a reference data set comprising a plurality of records, each record comprising a plurality of attributes. The method comprises further assigning each of the plurality of records an initial surrogate identifier value, assigning a plurality of block identifiers to each of the records by applying a locality sensitive hashing function to a predefined attribute of the records, resulting in the plurality of the block identifiers, and determining a final surrogate identifier value to each of the records assigned to one of the blocks such that the final surrogate identifier values in each block are uniformly distributed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information for a displayed resource that includes an image. In one aspect, a method includes providing, by a user device to a contextual information server, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, wherein the request specifies content of the active resource and further specifies that the active resource displayed on the user device includes an image, but does not include the image in the request, receiving a request for the image from the contextual information server, providing the image to the contextual information server, receiving a user interface element that includes contextual information regarding the image, and displaying the user interface element on the user device with the active resource.

Abstract: A method for updating a stable cuckoo filter used for membership testing of data streams, executed by a processor, is described. The method includes the steps of: performing a first hash on a first element to be inserted into the stable cuckoo filter to determine a first candidate bucket; performing a second hash on a fingerprint of the first element to determine a second candidate bucket; selecting a target candidate bucket from a group consisting of the first candidate bucket and the second candidate bucket; inserting the first element into the target candidate bucket; updating the stable cuckoo filter according to one or more of a random update strategy, an insertion failure update strategy, a scanning strategy, a skip scanning update strategy, a blocked design strategy and a local time-sensitive update strategy; and obtaining an updated stable cuckoo filter.

Abstract: Systems, methods, and non-transitory computer readable media may be configured to access first database and a second database. The first database may be structured for a first data type, and may include a first data of the first data type. The second database may be structured for a second data type different from the first datatype, and may include a second data of the second data type. The second data may be associated with the first data. A first information request relating to the first data and a second information request relating to the second data may be received. A first response to the first information request may be determined based on the second data. A second response to the second information request may be determined based on the first data. An interface, through which the first response or the second response is accessible, may be provided.

Abstract: Embodiments of the present invention are directed toward systems, methods, and computer storage media for using a neural network language model to identify semantic relationships between file storage specifications for replication requests. By treating file storage specifications (or at least a portion thereof) as “words” in the language model, replication vectors can be determined based on the file storage specifications. Instead of determining the relationship of the file storage specifications based on ordering within a document, the relationship can be based on proximity of the replication requests in a replication session. When a replication request is received from a user, the replication vectors can be used to determine a semantic similarity between the received replication request and one or more additional replication requests.