Abstract: Technologies are provided for reducing or eliminating transaction consistency anomalies that can occur during data replication, such as during database table replication. For example, commit values can be used to coordinate requests so that the requests are not performed on database tables with inconsistent data.

Abstract: A system predicts the intent of a user and proactively offers to perform a query that satisfies that intent. Upon the user's acceptance of the offer, the system begins a search for related information. The system examines such factors as search terms typed or spoken by said user, historical attributes of said user, historical journey attributes of said user, current journey attributes of said user, user location, user movement, current time, user profile, user calendar, user information stored on, or associated with, a device within the user's possession. The system then makes a prediction of any of the user's intent, query category, and issue category. Based upon the results of the system's prediction, a query that is relevant to the user's intent and/or issue categories is presented and, upon the user's command, the results of the search are returned to the user.

Abstract: Aspects described herein provide solutions to problems posed by a user. Input that includes a specified subject may be received from a user. A specified descriptor for the specified subject may be obtained from a hierarchical taxonomy associated with the specified subject. An information repository may be searched based on the specific descriptor, and entries stored at the information repository that are associated with the specific descriptor may be indicated in a list of results. The specific descriptor may be iteratively generalized to obtain generalized descriptors, and the information repository may be searched based on the generalized descriptors. The generalized descriptors may also be specialized to obtain specialized descriptors, and the information repository may be searched based on the specialized descriptors. The list of results may include entries stored at the information repository that are respectively associated with the generalized descriptors and the specialized descriptors.

Abstract: Methods, systems, and computer-readable media are disclosed to generate an interface for a web service and to query the web service. A method includes generating a user interface associated with a web service. The user interface includes one or more input parameter options associated with the web service. The user interface is generated based on a service specification and one or more series specifications associated with the service specification. User input is received via the user interface, where the user input includes a selection of at least one of the one or more input parameter options. A query of the web service is generated based on the user input, and the query reflects at least one selected input parameter option.

Abstract: A method of automatically modifying a computer data query is disclosed herein. The modification of the computer data query can be performed to restrict access to data. The computer data query can be modified by receiving the computer data query, identifying tables in the query and retrieving providers associated with the tables identified in the query. These providers can be linked to one or several predicates. These predicates can be retrieved and used to modify the query. The modified query can then be used to retrieve data from one or several tables identified within the query.

Abstract: In some embodiments, a system for database view generation may include a view generator configured to generate a database view for one or more database tables. The view generator includes a generation module configured to determine a generation template for the database view, where the generation template is a code structure describing a manner in which the database view is created. The code structure does not reference a database name of the one or more database tables. The generation module is configured to invoke a code composer to insert code commands into the generation template to build a structured query language (SQL) statement for the database view, where the SQL statement references the database name of the one or more database tables. The view generator is configured to create the database view based on the SQL statement.

Abstract: A computer implemented method for modification of search subjects in a set of predictive search terms in which a set of search terms from a user is received. One or more sets of predictive search terms generated and one or more search subjects within the one or more sets of predictive search terms is identified and communicated to the user. A modified search subject is received from the user in response to presenting the use with an option to modify the one or more search subjects. Furthermore the modified search sentence comprising the set of search terms and predictive search terms or modified search terms is searched.

Abstract: In one example in accordance with the present disclosure, a method for determining query plans includes obtaining a current query and generating a first literal and a first signature key from the current query. The method includes determining that the first signature key matches a second signature key stored in a parser cache and obtaining a literals data structure corresponding to the second signature key. The literals data structure comprises a group of literals, a list of high and low boundary intervals and a parameterization indicator. The method includes identifying, using the parameterization indicator, a parameterized literal in the group of literals. The method includes determining that a high and low boundary interval for the second parameterized literal contains the first literal and executing a stored query plan on the current query.

Abstract: In various embodiments, methods and systems for cross-filtering based on configurable direct relationships are provided. A selection of a first endpoint of a first table and a second endpoint of a second table is received. A direct relationship object is configured between the first table and the second table based on the first endpoint and the second endpoint. A cross-filtering direction and endpoint cardinality settings can also be configured for the direct relationship object. The direct relationship object may be configured as a many-to-one, one-to-many, or one-to-one. Automatic cross-filtering is configurable and can be set to cross-filter in one direction, the reverse direction, or both directions, with bidirectional cross filtering being a default configuration. The direct relationship object between the first endpoint and the second is configurable, such that, cross-filtering the first table and the second table to select rows for cross-filtering results is based on the cross-filtering direction.

Abstract: A method for controlled sharing, in a cognitive computing system having a memory and a processor, of content from a variety of content providers may include receiving, by the cognitive computing system, an inquiry, wherein the inquiry is directed to at least one content topic. The method may then include identifying, by the cognitive computing system, the at least one content topic, and determining that a cognitive component of the cognitive computing system managed by a content provider has access to a content repository addressing the at least one content topic. The method may further include distributing, by the cognitive computing system, the inquiry to the cognitive component. The method may additionally include receiving a response from the cognitive component.

Abstract: A stream of tuples can assigned identifiers to tuples to store only the nonduplicative tuples. In a streams processing environment, a stream application actor like an operator can receive a series of tuples, process them, and output another series of tuples. Each of the tuples can be assigned a tuple identifier. The tuple identifier can tag the tuple as associated with the operator. Another operator can receive the tuples, identify the duplicative tuples, and store only the nonduplicative tuples.

Abstract: A controller analyzes a tuple in an operator graph. The controller determines that the tuple includes one or more selected characteristics. These characteristics signify preferred data. The controller determines operations of the operator graph which can be suppressed. The controller suppresses the one or more operations. The controller suppresses those operations in response to the tuple including one or more of the selected characteristics.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: According to embodiments described in the specification, a method, system and apparatus for managing contact data are provided. The method comprises storing a plurality of contact attributes distilled from at least one data source in a memory, the contact attributes defining a plurality of contacts; receiving input data at a communications interface; identifying at least one search attribute from the received input data; selecting at least one of the plurality of contacts based on matches between the plurality of contact attributes and the at least one search attribute; and transmitting notification data based on the selected contact.

Abstract: A method of operation of a computing system includes: determining a search input; determining a user context associated with the search input for representing the user providing the search input; generating dynamic factor adjustments for candidate costs based on the user context; and determining a target result based on the dynamic factor adjustment and the candidate costs in response to the search input.

Abstract: This document presents a system and method for interaction with a social networking site where a user may be constrained from using some features of the site based upon pre-defined conditions. A social networking site such as a personal matching site may set a definite number of matches an individual user may make. Once all matches have been made, the user may be constrained against actions such as searching until the user has investigated those matches already made or has removed at least one match to free up a slot for the data from a new match to be entered into that slot. Constraints may be defined to prohibit any feature of the social networking site to control those features that are determined to be most subject to constraint enforcement.

Abstract: A method includes obtaining from a database: at least one initiating cause that causes a hazard, an initiating cause frequency corresponding to the at least one initiating cause, a set of independent protection layers configured to operate to prevent the hazard and including protection equipment for which no industry safety standards and regulations are defined, and a failure probability of each protection layer. The method includes estimating a frequency of occurrence of the hazard using a product of the initiating cause frequency and a failure probability of the set of independent protection layers. The method further includes adjusting the estimated frequency of occurrence of the hazard based on a change of at least one of: the initiating cause frequency, and a failure probability of a protection layer in the set of independent protection layers.

Abstract: Systems and methods perform various optimizations of an LLCS algorithm for use in determining if a set of input sequences are similar to a query sequence. The optimizations include filtering out sequence from the set of input sequences where the estimated similarity of the sequence with the query sequence is below a threshold value. The remaining sequences can then be provided to an LLCS algorithm where the output of the LLCS algorithm is used in a similarity function to determine an actual similarity of an input sequence with a query sequence.

Abstract: Systems and methods disclosed herein provide form search results in response to form-specific search criteria. One embodiment involves receiving, at an electronic form search server, input providing form-specific search criteria comprising one or more field characteristics. The embodiment further involves identifying, by the electronic form search server, one or more forms as search results based on form-specific search criteria. The embodiment further involves providing, by the electronic form search server, the search results.

Abstract: The present disclosure relates to a search method and a search device. The method includes: displaying a search page including at least one characteristic image, each characteristic image corresponding to a search process and representing a characteristic of search results of the corresponding search process; upon receiving an instruction of selecting a first characteristic image, performing a first search process corresponding to the first characteristic image, to obtain search results corresponding to the first search process; and displaying the search results corresponding to the first search process.

Abstract: Methods of aggregating and collaborating Internet searches, search pathways and components, and performing collaborative searches are disclosed. Data from a plurality of related Internet searches may be aggregated and analyzed to identify common content, pathways and search criteria to determine intent. Subsequent searches by the same or other persons for similar groupings of searches may be directed to the results output from the initial searches. The output from searches may be displayed in a dynamic results page, a word cloud, or other two-dimensional or three-dimensional formats in which users may change the weighting of certain search results, or link words in the results page. Collaborate searches may be performed, wherein a person may simultaneously see searches performed by other persons. Thus, the present invention advantageously displays search results that are particularly appropriate and relevant in much less time than individual searches would take to perform.

Abstract: One or more processors evaluate whether a subset of a dataset is sorted. One or more processors process the dataset if it is determined that the subset of the dataset is sorted.

Abstract: One or more processors evaluate whether a subset of a dataset is sorted. One or more processors process the dataset if it is determined that the subset of the dataset is sorted.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for ordering records in a blocked record environment. The method includes generating metadata associated with blocked records. The metadata is appended to the end of a set of blocked records. The blocked records and metadata is de-blocked and stored such that the metadata is grouped with its corresponding records.

Abstract: The state of a system is determined in which data sets are generated that include a plurality of data instances representing states of one or more components of a computer system. The data instances generated by one or more data set sources that are configured to output a data instance in response to a trigger associated with the one or more components. The data instances are normalized by the application of one or more rules. The data instances from individual data set sources are separately collated to generate groups of time-specific collated data instances. State types may be assigned to each of the collated data instance groups. Distributions of state-types across the groups may be determined and a list of infrequent state-types may be generated based on the determined distributions of state-types across the groups.

Abstract: To detect potentially malicious behavior or fraud, online environments maintain counts of a variety of data items received via a webpage or an application. A bucket scheme to track and retrieve these counts is described. The bucket system maintains a rolling count over a period of time. The bucket system comprises three different tiers, each containing buckets corresponding to different periods of time. When a new data item is received, one bucket in each tier is updated. The bucket is updated by generating a bucket address and initiating or incrementing a counter counting the number of times the data item was received. To retrieve the count over a specified period of time, the counters in a plurality of the buckets are read and aggregated.

Abstract: In some embodiments, an apparatus includes a data management module implemented in at least one of a memory or a processor. The data management module is configured to associate a different classification parameter with each data set from a set of data sets stored in the memory. The data management module is configured to store, in a first data set and using a first storage scheme based on a type of the classification parameter of the first data set, a set of values. Each value is associated with a different object. The data management module is configured to store, in a second data set and using a second storage scheme different from the first storage scheme and based on a type of the classification parameter of the second data set, a set of values. Each value is associated with a different object.

Abstract: An event-notification system provides for monitoring resource-status parameters so as to repeatedly generate resource-status values for each of N resource-status parameters applicable to the resources. Each datapoint specifies a resource, a time of collection, and the values of parameters for the resource at the time. The datapoints are represented in an N-dimensional space, including N dimensions corresponding to the resource-status parameters and one dimension devoted to time. The datapoints are clustered on a proximity basis. The clusters are manually classified as Normal or Ack-Abnormal. A machine-learning engine develops a model that allows the classifications to be automated. Alerts are sent for respective Abnormal clusters rather than for each abnormal datapoint, thus reducing the amount of data an administrator must deal with to address potential problems.

Abstract: An index for large databases is disclosed. Data is grouped into clusters and the clusters are grouped into levels of detail. Analysis results are determined based on progressive data sampling. Sampling is conducted based on the level of detail required and/or the resources (time or computing resources) that are available. Larger, more concentrated clusters, at higher levels of detail, are sampled more sparsely. Smaller, more diffuse clusters, at lower levels of detail, are sampled more intensively. Analysis results, including outlier data, include proportional representation from the whole database up to the level of detail required. Results are quickly determined with specified degree of accuracy, based on initial sampling, and are refined with subsequent sampling.

Abstract: Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such as Web mining, search marketing, bioinformatics, citation analysis, and epidemiology. A probabilistic model is presented for relational clustering, which also provides a principal framework to unify various important clustering tasks including traditional attributes-based clustering, semi-supervised clustering, co-clustering and graph clustering. The model seeks to identify cluster structures for each type of data objects and interaction patterns between different types of objects. Under this model, parametric hard and soft relational clustering algorithms are provided under a large number of exponential family distributions.

Abstract: Computer-implemented systems and methods are disclosed for indexing and aggregating proxy server data. In accordance with some embodiments, the systems comprise a memory device configured to store a set of instructions, and one or more processors configured to execute the set of instructions to receive a plurality of log lines of proxy server data comprising a plurality of data components and index one or more of the plurality of data components for the plurality of log lines. The processors also generate a plurality of log data records, each including the one or more indexed data components, and generate a summarized data record by aggregating one or more log data records having at least one matching indexed data component.

Abstract: An in-memory database system and method for administrating a distributed in-memory database, comprising one or more nodes having modules configured to store and distribute database partitions of collections partitioned by a partitioner associated with a search conductor. Database collections are partitioned according to a schema. Partitions, collections, and records, are updated and removed when requested by a system interface, according to the schema. Supervisors determine a node status based on a heartbeat signal received from each node. Users can send queries through a system interface to search managers. Search managers apply a field processing technique, forward the search query to search conductors, and return a set of result records to the analytics agents. Analytics agents perform analytics processing on a candidate results records from a search manager.

Abstract: A method, apparatus and computer program product for Functional Space-Time Trajectory Clustering. The method comprises receiving collections of data structures comprising location and time descriptors. The method further comprises estimating functional curves from the collections of data structures. The method further comprises reducing dimensions of the functional curves; and clustering the functional curves into clusters.

Abstract: A source code search comprises a two-pass search. The first pass comprises a topological measure of similarity. The second pass comprises a semantic measure of similarity. The query source code is a user-selected portion of source code. The results may be ranked and output to an I/O device.

Abstract: To analyze data fields in an unstructured data set or a data set where the structure is unknown, masks can be constructed and used to determine locations of the individual fields within each data set entry. The locations can be indicated as offsets within a data set entry. An offset indicates where a data field begins. A set of masks can be constructed for at least some of the entries in a data set (e.g., a file). The masks can include a mask for padding (e.g., spaces, tabs, zeroes, etc.), and each expected type of data (e.g., alphabetic character, numeric character, and symbol). Each type of mask can be aggregated across data set entries and then analyzed to identify individual field locations. With the information about field locations, the data set can be analyzed.

Abstract: Provided is a sorting process of journalistic articles as a function of website feeds. Each feed includes a piece of journalistic information including a text section. The sorting process utilizes a computer unit including a database of journalistic articles and a noise database including disturbance words, as well as a server including the feeds. The process includes a reading step, an identifying step, a text analysis step, and a choosing step.

Abstract: In some embodiments, a system is provided comprising at least one processor programmed to process an input text to identify a plurality of semantic patterns that match the input text, wherein, for at least one semantic pattern of the plurality of semantic patterns: the at least one semantic pattern comprises a plurality of semantic entities identified from the at least one input text, and the plurality of semantic entities occur in a common context within the at least one input text. The at least one processor may be further programmed to use statistical information derived from training data to associate a respective weight with each semantic pattern of the plurality of semantic patterns.

Abstract: Computer systems and methods generate a cluster chart for HR-related documents. A host computer data center comprises a database for electronically storing HR-related documents, a web server, and a programmable computer device. The programmable computer device is programmed to determine clusters of prevalent terms in a collection of HR-related documents in the database. The collection of HR-related documents from which the clusters are generated is identified based on search criteria submitted from a client computer device. The clusters of prevalent terms in the collection can be determined using a clustering algorithm employing algebraic transformations of a term-document matrix generated from the collection of HR-related documents. The programmable computer device is also programmed to assign each of the HR-related documents in the collection to one or more of the determined clusters, and to generate a chart graphically showing the clusters. Each cluster in the chart has a characteristic (e.g.

Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

Abstract: As provided herein, a user of a client device is identified as viewing content (e.g., a movie) and generating user signals related to the content (e.g., a social network post about the movie). An expression of interest may be determined from the user signals (e.g., the user may write “this scene is amazing!” within the social network post). Responsive to the expression of interest exceeding an interest threshold, a timestamp is generated for a portion of the content occurring at a time corresponding to the expression of interest. A segment is extracted from the content based upon the timestamp. Summary content, such as a trailer or a summary video for the movie that depicts relatively interesting segments of the movie, is generated to comprise the segment and/or other segments. Users may view the summary content in order to obtain a brief overview of relatively interesting portions of the movie.

Abstract: A method and a system for providing a social service based on music information is provided. The method includes: obtaining at least one matching rule of pre-stored matching rules, and generating a match instruction, wherein the matching rules are established according to the music information; sending a match request for searching a social interaction terminal; receiving a reply message returned from the server according to the match request; obtaining the identification information corresponding to the linking object according to the identification list, and sending a link request for social interaction to the linking object.

Abstract: A content provider system ranks media content items with respect to a particular user based on selection scores determined for each of the media content items. The selection scores may be determined using a particular model that calculates a predicted selection score based on feature values associated with the content item with respect to the particular user. The feature values may indicate properties of the media content item, the particular user, or the particular user's relationship with the content item, including information about the novelty of the media content item with respect to the user. The particular model may be trained with sample user consumption data points that represent various combinations of media content items and users. The data point information evaluated during the training of the particular model may cause the model to assign higher selection scores to content items that are novel in particular ways.

Abstract: A communication system and method are disclosed. The system and method use a contact type and a confidence level to determine whether to proceed with an operation, which operation to perform and/or how to perform an operation. The method and system may be used to determine a confidence level for a contact type, and may be used to update existing contact information, as well as for other uses.

Abstract: A method for modification of search subjects in a set of predictive search terms in which a set of search terms from a user is received and communicated to a search engine. One or more sets of predictive search terms from the search engine based on the set of search terms is received from the search engine and one or more search subjects within the one or more sets of predictive search terms is identified. A plurality of set of predictive search terms, where the one or more search subjects are displayed differently from other displayed terms is displayed and the user is presented with an option to modify the one or more search subjects. A modified search subject is received and a modified search sentence comprising the set of search terms, and one or more of the predictive search terms and the modified search subject is displayed.

Abstract: Data messages having different priorities may be stored in different communication buffers of a network node. The data messages may then be forwarded from the communication buffers to working buffers as space becomes available in the working buffers. After being forwarded to the working buffers, the data messages may be available to be processed by upper-layer operations of the network node. Priorities may be assigned to the data messages based on a priority level of a query associated with the data messages, a priority level of an upper-layer operation assigned to process the data messages, or combinations thereof.

Abstract: Embodiments described herein generally relate to searching of media items associated with one or more keywords. Content search features may be generated and configured to receive search scope selections. A root level limitation may be associated with a folder within a media organization architecture. A query limitation may be associated with the content search features. In certain embodiments, means for automatically correcting the search scope selections to satisfy the query limitation are provided.

Abstract: An individualized interest graph is mapped by receiving raw data, including social media data, pertaining to the individual, extracting key terms from the raw data, querying a knowledge base with the key terms to identify uniform resource identifiers (“URIs”) in the knowledge base, identifying categories within the knowledge base that encompass the URIs, and defining the interest graph to include these categories. An analogous process can be followed to generate a segment graph. Overlap between the individualized interest graph and the segment graph can be used to segment the individual, for example to personalize a retail interaction with the individual.

Abstract: Disclosed are examples that relate to searching for content associated with applications. In various examples, a system can include a computing device and a search interface component executable by the computing device. The search interface component can cause the computing device to obtain a search query from a search component and search for application content associated with the search query. The application content can be associated with respective sandboxes. The search interface component can also cause the computing device to provide search results to the search component.

Abstract: A Microblog-based event context acquiring method has: an event-related acquiring information of original microblogs and reposted microblogs thereof contained in a predetermined topic within a statistical time period; calculating an event heat time distribution about the topic corresponding to the information of the original and reposted microblogs thereof related to the event within the statistical time period, the event heat indicating a degree of concern of the original microblogs and the reposted microblogs thereof related to the event in a user group; and selecting, from the statistical time period, a plurality of event context time nodes and corresponding node events according to the event heat time distribution about the topic within the statistical time period so as to constitute an event context of the topic. Event context of the event contained in the predetermined topic by means of the microblogs is acquired quickly and accurately.

Abstract: A system for determining a preference index comprises a transactions database storing transaction data indicative of a plurality of transactions carried out over a payment network, the transaction data comprising, for respective transactions, payment card identifiers, merchant identifiers, merchant category codes, issuer identifiers, payment device types, geographical locations, transaction amounts, transaction times and transaction dates. The system also comprises a transaction indexing component in communication with the transactions database, the transaction indexing component being configured to generate a database query to query the transactions database to retrieve transactions for a plurality of payment cards within a predetermined time window; and a preference index component.