Abstract: The present disclosure relates to a method for enforcing constraints on data in a data processing system. The method comprises providing a set of constraints on the data. A first data update request may be received at the transactional engine and executes on the first dataset. A second data update request associated with the received data update request is determined and sent by the transactional engine to the analytical engine. The analytical engine executes the second data, resulting in a set of changes in the second dataset. The transactional engine commits the update of the first dataset before or after receiving the results of the checking of the set of constraints. The update on the first dataset is aborted by the transactional engine in response to receiving the results of the checking of the set of constraints, wherein the results indicate that the set of constraints are not met.

Abstract: A data management system including an AP server and a DB server. The AP server sends business data to the DB server and requests registration. The business data includes combination of parent data and a plurality of pieces of child data with mutual relevance, and each child data has ID of the parent data. In registering business data, the AP server first tries to register each child data, and requests registration of the parent data when a notification of registration completion of all pieces of the child data arrives from the DB server. When the notification of registration completion of any of the child data has not arrived, the AP server cancels the registration of the parent data. In referring to the business data, the AP server sets only child data with related parent data registered therein as a target.

Abstract: A method, computer system, and computer program product are provided for processing an output of batch processed information. A document storage system receives the output of batch processed information from a number of company portals, websites, and online systems of organization. The document storage system separates the output into individual documents and individual forms. The document storage system indexes the individual documents and forms according to metadata. The metadata includes structural attributes extracted from the individual documents and forms, and company relevant parameters identified from business intelligence for the organization. The document storage system stores the individual documents and forms in association with the metadata. Responsive to storing the individual documents and forms, the document storage system generates an event message. The event message comprises information about the storing of the individual documents and forms.

Abstract: A computer system generates a similarity-optimized hierarchy for hierarchical data to improve data access performance and content discovery. An example method includes receiving hierarchical data in an original hierarchy having a plurality of nodes and a depth of d, generating a respective embedding for each node of the plurality of nodes, and determining, for each node of the plurality of nodes, respective k-nearest neighbors based on the respective embedding. Starting with nodes at depth din the original hierarchy, the method includes generating sibling groups, each sibling group having at least one node at depth d, identifying, for each node at depth d, a similarity-optimized parent from depth d?1, and associating each node at depth d with its respective similarity-optimized parent in a similarity-optimized hierarchy. The method also includes completing the similarity-optimized hierarchy by repeating the generating, identifying and associating with nodes at depth d?1 until reaching the hierarchy root.

Abstract: A computer implemented method of data access to data stored in one or more data stores includes receiving a request to retrieve data from the one or more data stores; extracting characteristics of the request to classify the request according to a request classification; identifying a model for execution of one or more queries to one or more data stores; executing the one or more queries according to the model to formulate a response to the request, wherein the model for execution is identified based on a class of the request and includes an identification of one or more data stores to which the one or more queries are to be directed to formulate the response; and monitoring execution of one or more queries for a class of request and revising the model in accordance with predetermined criteria.

Abstract: A technique for instance-specific feature-based cross-document sentiment aggregation includes analyzing input data to determine an entity referenced in the input data. One or more salient features of the entity are identified. Multiple documents that reference the entity are located. The salient features in each of the multiple documents are identified. Respective sentiment values are assigned to each of the salient features identified in the multiple documents. Respective sub-graphs are created for each of the multiple documents. The sub-graphs specify the sentiment values assigned to each of the salient features identified in an associated one of the multiple documents. The assigned sentiment values for each of the salient features are aggregated based on the sub-graphs. Finally, output data that is associated with the input data is generated. The output data provides an indication of the aggregated sentiment value for each of the salient features.

Abstract: The embodiments relate to generating hierarchical patterns based on a corpus of text. The corpus is analyzed, which includes extracting a set of features of the corpus. A set of grammatical patterns are generated based on the extracted features. The set of grammatical patterns includes at least one grammatical pattern generated from an internal pattern and at least one grammatical pattern generated from an external pattern. The grammatical patterns of the set are organized into a hierarchy and/or are ranked. The hierarchy and/or ranking are visually displayed.

Abstract: A system, process, and method for organizing unstructured data stored in a database environment with table structure such that the data is retrievable using relational set logic, even with a database environment that does not provide relational table structures, is disclosed. The method creates, updates, and deletes database objects as necessary to describe the relationships between disparate data object types for various unique values and to provide the necessary information to retrieve the desired data objects. A device embodying and enabling the practice of the method is also disclosed.

Abstract: In a data linkage management system, at least each node of a specified plurality of organizations among a plurality of nodes holds a tolerance range rule that defines a specified tolerance range relating to discrepancies among data acquired from a specified external system, and forms a consensus that tolerates discrepancies among the data by passing a tolerance pass-fail judgment relating to discrepancies among the data according to the tolerance range rule in regards to a transaction issued by each node for the data.

Abstract: Techniques are provided for processing a database command in a sharded database. The processing of the database command may include generating or otherwise accessing a shard key expression, and evaluating the shard key expression to identify one or more target shards that contain data used to execute the database command.

Abstract: A storage medium storing a program that causes a processor to execute for acquiring distribution data indicating a distribution of spots in an area to be searched, and area data indicating positions of divided areas obtained by dividing the area to be searched; generating an adjacency matrix indicating an adjacency relation between the divided areas from the area data; generating an evaluation function for evaluating selection of the divided areas using: a variable indicating selection of consecutive divided areas, the distribution data, and the adjacency matrix; calculating a gradient of a value of the evaluation function from a current value of the variable; executing a gradient method search for updating the value of the variable using the calculated gradient; and determining selection of the divided areas as an optimal area for event occurrence analysis based on a result of the gradient method search.

Abstract: Various methods, apparatuses, and media for facilitating data generation based on a set of metadata are provided. The methodology includes operations of receiving a first input that relates to data attributes and corresponding data attribute descriptions; receiving a second input that relates to applicable data quality rules; using the received inputs to generate a set of metadata; and using the generated set of metadata to generate new data that is compatible with the data quality rules. The data quality rules may be used to determine certification metrics that are used to analyze the newly generated data, in order to ensure a result that has a high level of data quality.

Abstract: A request for a ranked list of contacts of the user is received from a client device associated with a user. The request identifies a purpose for the ranked list of contacts. A list of the user's contacts is retrieved from a data store and a subset of the user's contacts that are likely to interact with the user in a specified future time period is identified. Ranking scores are calculated for the subset of the user's contacts, each ranking score indicating a probability that the user will interact with a corresponding one of the subset of the user's contacts in a manner consistent with the purpose. A ranked list of contacts is determined based on the ranking scores and sent to the client device.

Abstract: Described herein is a system and method for training cardinality models in which workload data is analyzed to extract and compute features of subgraphs of queries. Using a machine learning algorithm, the cardinality models are trained based on the features and actual runtime statistics included in the workload data. The trained cardinality models are stored. Further described herein is a system and method of predicting cardinality of subgraphs of a query. Features for the subgraphs of the query are extracted and computed. Cardinality models are retrieved based on the features of the subgraphs of the query. Cardinalities of the subgraphs of the query are predicted using the retrieved cardinality models. One of the subgraphs of the query is selected to be utilized for execution of the query based on the predicted cardinalities.

Abstract: Technologies are described here for, among other things, improving search query relevance by executing a query on a search engine, retrieving search-page-data generated from executing the query, the search-page-data including document-titles and universal resource locators (URLs), each document-title being a title of a document associated with a URL, determining relevant-entity-words in the query from an entity relevance score for matching search terms in the query, Domain-URLs, and Domain-Titles, determining relevant-intent-words in the query from an intent-word relevance score based on a number of times a search term appears in the query and the URLs relative to other search terms in the query and the URLs, comparing each of the determined relevant-entity-words and each of the determined relevant-intent-words with a plurality of stored past-user queries, retrieving the plurality of stored past-user search queries including the relevant-entity-words and the relevant-intent-words, and transmitting a set of qu

Abstract: A system and method for intelligent content searching is disclosed herein. The system saves all searches executed by the user and periodically re-executes one or more of the previously saved searches and display the subsequent search results to the user at an appropriate time without any user intervention. In one aspect, the system periodically re-executes one or more of the previously saved searches upon the occurrence of a trigger event, which may be trending events, news events, type of menus and/or screens accessed, new content being added on one or more service providers, a boot event, passage of time since last search, etc. In this way, users do not need to set alert or follow any search topic.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: Infusion devices and related medical devices, patient data management systems, and methods are provided for monitoring a physiological condition of a patient. An exemplary method of querying a database involves receiving an input query from a client device, identifying a logical layer of a plurality of different logical layers of the database for searching based at least in part on the input query, generating a query statement for searching the identified logical layer of the plurality of different logical layers of the database based at least in part on the input query, querying the identified logical layer of the database using the query statement to obtain result data, and providing a search result influenced by the result data.

Abstract: Disclosed is a system for collecting information about operations performed on a client device and storing the operation information. Operations are combinations of view-structures and events that occur as a user interacts with applications on a client device. A view-structure may be a data structure including information about interface elements of a software application and information about content stored within the interface elements. An event may be an action performed with respect to an interface element, or another type of input to the system. The system receives information about events that occur on a client device and provides a channel of communication between an operation mimicry system and an operating system of the client device such that the operation mimicry system can store data about executed operations.