Abstract: A method for generating a graphical depiction of summarized event sequences includes receiving a plurality of event sequences, each event sequence in the plurality of event sequences including a plurality of events, and generating a plurality of clusters using a minimum description length (MDL) optimization process. Each cluster in the plurality of clusters including a set of at least two event sequences in the plurality of event sequences that maps to a pattern in each cluster. The pattern in each cluster further includes a plurality of events included in at least one event sequence in the set of at least two event sequences in the cluster. The method includes generating a graphical depiction of a first cluster in the plurality of clusters, the graphical depiction including a graphical depiction of a first plurality of events in the pattern of the first cluster.

Abstract: A method may include receiving a stored procedure associated with data stored in a plurality of data stores. The stored procedure may include a plurality of executable statements. The method may further include identifying a first executable statement of the plurality of executable statements to be executed by the processor and a second executable statement of the plurality of executable statements that is executable by at least one of a plurality of other processors. The other processors each may have access to only a respective one of the plurality of copies of the data. The method may further include executing the first executable statement. A system and computer-readable medium may also be implemented.

Abstract: An exemplary method includes displaying a UI that includes a data flow pane and a data grid pane, and in response to user selection of a node, displaying, in the data grid pane, a data grid corresponding to the user-selected node. The method further comprises receiving user input on a first cell in the data grid that changes a first data value v1 for the first cell (intersection between a first column and a first row of the data grid) to a first modified data value w1. The method further comprises determining a formula f(v1)=w1 corresponding to the input, inserting a new node into the flow diagram immediately after the user-selected node, and applying the formula f to the first column for each of the plurality of rows in the data grid, including changing a second data value v2 to a second modified data value w2, where v2?v1 and w2?w1.

Abstract: The disclosed computer-implemented method for enabling search services to highlight documents may include (1) creating, via an internal search service, a highlight index that comprises an analyzer for at least one type of document, (2) receiving a search query configured for an external search service and a document that is of the type and that comprises a search result for the search query, (3) querying the highlight index in order to retrieve the analyzer for the type of document from the highlight index, and (4) sending the analyzer, the document, and the search query to a search service in order to enable the search service to display at least one highlighted string extracted from the document via the analyzer, wherein the highlighted string originates from the search query. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems and methods for scanning signatures in a string field. In one implementation, the invention provides a method for signature scanning. The method includes receiving a particular string field, scanning the particular string field for a plurality of signatures using a larger scan step size, scanning the particular string field for the remaining signatures that are shorter than what can be scanned by the larger scan step size separately either using the same scanning method but a smaller scan step size or using a different scan method and the same or a smaller scan step size, and outputting any identified signatures in the particular string field.

Abstract: A system includes a plurality of clustered servers, a plurality of clients communicating with the plurality of clustered servers, and a grace database. Each of the plurality of clustered servers maintains a respective client recovery list. A client of the plurality of clients is configured to send a reclaim request to a server of the plurality of clustered servers. The grace database is configured to maintain an epoch value and a reclaim value. The epoch value indicates the current epoch, and the reclaim value indicates from which epoch reclaim is allowed. The server of the plurality of clustered servers is configured to maintain a client list and receive the reclaim request from the client. The client list indicates each client currently holding state on the server.

Abstract: Systems, methods, and computer-readable media for lazy tracking mechanisms for web caching systems are provided. The lazy tracking mechanism may track and perform asynchronous (async) computation of dirty records for client-side caching mechanisms. The async computation of dirty records may include tracking or accounting for invalidated records relevant to a particular client or user system. Invalidation messages may be sent to client/user systems in response to receipt of a request for updated records, or in response to a request for a particular item. Other embodiments may be described and/or claimed.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: A new approach is proposed that contemplates systems and methods to examine and determine quality of objects cited by citations in a search result based on a citation graph that includes citing subjects, citations, and cited objects. First, influence scores of a plurality of subjects/sources that compose the citations of the objects in the search result are calculated. The quality of the objects cited by the subjects can then be determined by examining the influence scores for the subjects of the citations. Finally, the cited objects selected can be presented to a user or provided to a thirty party for further processing together with the relevant citations and citing subjects.

Abstract: A method includes comparing a search key that includes bits having respective values and bit positions to a mask to identify masked and unmasked portions of the search key. The mask corresponds to multi-dimensional keys and has first and second values in bit positions corresponding to and not corresponding to, respectively, common bits. Each common bit has a respective same value and occurs in a respective same position in the multi-dimensional keys. The masked and unmasked portions are bits at bit positions corresponding to bit positions of bits of the mask having first and second values, respectively. The method includes determining, based on determining that values in bit positions of the masked portion match values in corresponding bit positions of a pattern, that the unmasked portion matches a compressed key without decompressing the compressed key, and based thereon, identifying a successful match between the search and compressed keys.

Abstract: A method, computing system and computer program product are provided. A nested loop join access plan for a query is executed and processed records of a most outer table of a nested loop join that satisfy local predicates are counted. When a count of the processed records is not less than a threshold value, a cost to complete execution of the nested loop join access plan and a cost of executing a new access plan based on recalculated filter factors for local predicates of the query are compared. When the cost to complete is less, execution of the nested loop join access plan is resumed to complete running of the query. When the cost of executing the new access plan is less, the new access plan is executed to rerun the query. A result of the query is provided.

Abstract: A computer system receives a query and converts the query into one or more input data types each associated with a respective piece of input constraint data, and one or more output datatypes corresponding to desired data. A data path workflow scheme is created from the datatypes and a catalog of data path modules each of which has defined datatype of its input(s) and output(s) by building candidate data paths forward from the input and rearward from the output of the data path until data paths from all of the outputs connect with at least one of the data path inputs. The data path is then optimized and converted to an executable code data procedure and then run with the constraint data as the input to the procedure. The results can be displayed to a user display device by presentation modules based on the datatype of the output.

Abstract: A system and method includes using a queue with map-reduce. The system includes a computer cluster that is to execute, by a first node, a first reduce operation on a first location of data to generate a first plurality of markers indicative of data at the first location of data and execute, by a second node, a second reduce operation on a second location of data to generate a second plurality of markers indicative of data at the second location of data. Responsive to generation of one or more markers, the computer cluster is to submit the one or more markers to a queue. Responsive to completing the first reduce operation by the first node, the computer cluster is to direct the first node to perform a first copy operation that copies first data identified by a first marker of the one or more markers in the queue.

Abstract: An ordered sequence of two or more filter provider executable objects are associated, each configured to select successive subsets of data in a registry via a database upon a user request to create and configure a filtered selection. Upon a user selection of a save feature, each associated filter provider executable object is serialized in the ordered sequence, and each serialization is collected into an ordered list of serializations and saved. The serialization of each filter provider executable object is performed by one of the respective filter provider executable object and a filter provider executable object of a same type as the respective facet provider object. A selection statement is constructed from the associated filter provider executable objects in the ordered sequence. A difference between the constructed selection statement and an actual selection statement is calculated and the selection statement difference is appended to the saved ordered list of serializations.

Abstract: Transactions include text fields, such as description fields. Transactions are extracted from financial institutions using web-scraping extraction. In the process of extracting transactions, errors can be introduced into text fields, such as the inclusion of a space within a word or the removal of a space between words. A statistical approach is applied to the text fields. When two alternative text fields are presented, the alternative that statistically includes more common tokens, such as unigrams and bigrams, is chosen as the correct alternative. The incorrect alternative is replaced by the correct alternative in the text field.

Abstract: Methods, systems, and computer-readable storage media for predicting a type of an event in a computer-implemented system, implementations including receiving event data including a set of features representative of an event, determining a probability for at least one feature in the set of features from a data structure that stores a plurality of feature-probability pairs, the data structure representative of a type of event, providing a joint probability based on the probability of the at least one feature, the joint probability indicating a likelihood that the event is of the type of event, comparing the joint probability to a threshold to provide a comparison, and selectively executing one or more actions based on the comparison.

Abstract: A system and method for managing data storage and data access with querying data in a distributed system without buffering the results on intermediate operations in disk storage.

Abstract: The present subject matter relates to techniques and equipment for creating and managing a directory of individuals and businesses/enterprises by their mobile phone number, and using the directory to effectively store, manage and direct mail communication information to the individuals and businesses using preferred delivery methods of the individuals and businesses/enterprises. An electronic communication system is configured to use a mobile phone number to reference data and to manage communications to a corresponding recipient.

Abstract: Systems and methods for scanning signatures in a string field. In one implementation, the invention provides a method for signature scanning. The method includes receiving a particular string field, scanning the particular string field for a plurality of signatures using a larger scan step size, scanning the particular string field for the remaining signatures that are shorter than what can be scanned by the larger scan step size separately either using the same scanning method but a smaller scan step size or using a different scan method and the same or a smaller scan step size, and outputting any identified signatures in the particular string field.

Abstract: Relational database schema generation includes obtaining an input requirements specification for a relational database to be generated, interpreting text characters of the requirements specification as values of a predefined character encoding, parsing the interpreted text characters and identifying complete sentences of the requirements specification, identifying, using an input dictionary that specifies combinations of character values of the predefined character encoding, proper nouns in the identified complete sentences and common nouns in the identified complete sentences, and generating a relational database schema script for the relational database, the generating including indicating the identified proper nouns of the complete sentences as entities of the relational database and indicating the identified common nouns of the complete sentences as attributes of those entities.