Abstract: A query pattern handler may be configured to determine at least one query pattern to be matched against a stream of events, and may be configured to determine a plurality of run-time patterns representing active instances of the at least one query pattern which are currently available for matching, and which each include a plurality of states. An event scheduler may be configured to receive an event of the stream of events, the event associated with a current event set of the stream of events. A run-time pattern scheduler may be configured to determine a ranked set of the run-time patterns based on a priority metric which characterizes, for each run-time pattern, an advancement of each run-time pattern from a current state thereof when matched against the current event set. A pattern match evaluator may be configured to evaluate each run-time pattern of the ranked set, in turn, against the current event set.

Abstract: Embodiments of the present invention provide a method and system for dynamically creating a view in a distributed processing system. The system can have nodes such as a service node and a directory with entries. An object class of a view can be defined as including an attribute type that accommodates a new attribute value. An attribute value associated with one of the nodes can be received at the service node whereupon it can be determined whether the attribute value is associated with the new attribute value. A new view can be created if the attribute value is associated with the new attribute value.

Abstract: Provided are a method, system, and article of manufacture for applying a policy criteria to files in a backup image. A backup image of files in a file system is maintained. A policy is applied to the files in the backup image to determine files satisfying a policy criteria. A list is prepared indicating the determined files. The determined files in the file system are accessed and a deferred operation indicated in the applied policy is applied to the accessed files in the file system.

Abstract: Methods, computer-readable storage media and computer systems are provided for transforming a directed acyclic graph (“DAG”) query plan into a linear plan. A DAG query plan may include a first operator and a second operator that are scheduled to be executed in parallel. The DAG query plan may be modified so that the first and second operators are executed in series as an upstream operator and a downstream operator. A data unit output from the upstream operator may be marked to indicate that the data unit has been processed by the upstream operator. The data unit received as input at the downstream operator may be inspected to determine whether the data unit has been marked. Once in linear form, the query plan may be optimized to conserve computing resources.

Abstract: A tree-structured database is collapsed into a two-column table. The two-column table includes a characteristic key value for a given leaf node in the first column and the system identification (SID) relating to the characteristic key value in the second column and also identifying the node that leads to the characteristic key value. Data is presented by coupling the characteristic key value with a transaction table. A query that is formulated in an infocube may be translated to a relational data base query, collapsed, and reformulated into an infocube result set, or vice versa.

Abstract: Architecture for finding related entities for web search queries. An extraction component takes a document as input and outputs all the mentions (or occurrences) of named entities such as names of people, organizations, locations, and products in the document, as well as entity metadata. An indexing component takes a document identifier (docID) and the set of mentions of named entities and, stores and indexes the information for retrieval. A document-based search component takes a keyword query and returns the docIDs of the top documents matching with the query. A retrieval component takes a docID as input, accesses the information stored by the indexing component and returns the set of mentions of named entities in the document. This information is then passed to an entity scoring and thresholding component that computes an aggregate score of each entity and selects the entities to return to the user.

Abstract: Techniques are disclosed for adding entities to a group of entity resolution candidates by selecting entities that have a minimum threshold of similarity to a candidate, allowing a greater number of resolutions in an entity resolution system. To resolve an incoming identity record, an initial group of candidates may be selected from known entities by identifying entities that match a candidate building attribute of the incoming identity record. Additional candidates may be selected by identifying entities with some information that is similar to one of the candidate entities.

Abstract: A learning system for a search ranking function model may include a computer program that iteratively refines the model using new queries and associated documents from an unlabeled training set. The unlabeled training set may include a set of queries for which the associated documents have not been labeled as “relevant” or otherwise labeled. The new queries may be selected based on a similarity to and an accuracy of each neighbor from a labeled training set, such as a labeled validation set. Upon selection, the documents associated with the new queries may be labeled. The new queries and their associated documents may be accumulated into a labeled training set, such as a labeled training set, and a refined model may be learned based on the augmented labeled training set. The model may be iteratively refined until it is determined that the model is adequate.

Abstract: Example-driven creation of record matching queries. The disclosed architecture employs techniques that exploit the availability of positive (or matching) and negative (non-matching) examples to search through this space and suggest an initial record matching query. The record matching task is modeled as that of designing an operator tree obtained by composing a few primitive operators. This ensures that record matching programs be executable efficiently and scalably over large input relations. The architecture joins records across multiple (e.g., two) relations (e.g., R and S). The architecture exploits the monotonicity property of similarity functions for record matching in the relations, in that, any pair of matching records have a higher similarity value than non-matching record pairs on at least one similarity function.

Abstract: A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

Abstract: Certain embodiments provide for systems and methods of monitoring data sent from a requested device to a requesting device and removing certain portions of the data such as malicious or otherwise objectionable content. Objectionable content may include, for example, potentially executable web content. In certain embodiments, the systems and methods remove uniform resource locator (URL) links from the intercepted data which point to web pages having malicious or otherwise objectionable content.

Abstract: A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

Abstract: A system and method to facilitate importation of data taxonomies within a network are described. Advertiser entities access a data storage module within a network-based entity to retrieve content information from one or more content taxonomies stored within the data storage module. Subsequently, the advertiser entities select advertisements targeted to specific users based on the retrieved content information and further transmit the advertisements to the network-based entity. Furthermore, publisher entities and/or advertiser entities transmit data, such as, for example, associated taxonomy information, to the network-based entity. The entity receives the respective taxonomy information and parses the taxonomy information to extract node information and associated categories related to the received information. Finally, the entity integrates the node information and associated categories into one or more taxonomies stored within the data storage module.

Abstract: Provided are a method, system, and article of manufacture for applying a policy criteria to files in a backup image. A backup image of files in a file system is maintained. A policy is applied to the files in the backup image to determine files satisfying a policy criteria. A list is prepared indicating the determined files. The determined files in the file system are accessed and a deferred operation indicated in the applied policy is applied to the accessed files in the file system.

Abstract: A system for providing telecommunications equipment information and customer information that includes a display and a processor. The display displays a graphical user interface that allows a user to access the equipment information and the customer information. The graphical user interface includes at least one input area that allows a user to input search criteria, related to at least one of equipment data and customer data, to initiate a search. The graphical user interface also includes at least one results area that displays a result of the search, the result including at least one of the equipment information and the customer information related to the search criteria. The processor implements the search for at least one of the equipment information and the customer information in response to the input search criteria.

Abstract: A computer-implemented method can include translating a search query from a first language to a second language, comparing the translated query with content in the second language, and identifying content in the second language relevant to the translated query based on the comparing. Also, a computer-implemented method can include translating content in a second language at one or more network locations into a first language, comparing the translated content with a search query written in the first language, and identifying, from the translated content, content relevant to the query based on the comparing.

Abstract: Information retrieval systems face challenging problems with delivering highly relevant and highly inclusive search results in response to a user's query. Contextual personalized information retrieval uses a set of integrated methodologies that can combine automatic concept extraction/matching from text, a powerful fuzzy search engine, and a collaborative user preference learning engine to provide accurate and personalized search results. The system can include constructing a search query to execute a search of a database. The system can parse an input query from a user conducting the search of the database into sub-strings, and can match the sub-strings to concepts in a semantic concept network of a knowledge base. The system can further map the matched concepts to criteria and criteria values that specify a set of constraints on and scoring parameters for the matched concepts.

Abstract: A technique provides a dedicated software thread for communicating backup history to clients of a storage system during backup operations. Illustratively, an operating system of the storage system may execute one or more “session” (e.g., backup) threads and a “worker” (e.g., backup history) thread. In particular, the one or more session threads are each configured to backup stored data for a corresponding client to a backup storage device and to generate backup history of data backed up to the backup storage device. Also, the worker thread is configured to obtain the backup history from the one or more session threads, and transmit the backup history to the corresponding client of each of the one or more session threads. In this manner, the worker thread may wait for a response from the corresponding clients, while the one or more corresponding session threads continue to backup the stored data and generate backup history.

Abstract: Data files are action tagged by electronic devices as the files are used, and such tags are used to compute a total value for each data file among a group of data files for the purpose of running comparative-type operations, e.g., sorting or organizing the group of data files, or searching for one or more files in the group. The action tags are carried on each data file, preferably in the header, so as to travel with the file as the file is transferred among devices. The action tagging generally involves tracking, and storing as metadata in the data file, each occurrence of each of multiple indirect actions, and one or more characteristics associated with each indirect action occurrence. In setting up a comparative-type operation, a user can select via an interface one or more parameters with which to constrain each input value computation for respective indirect activities. A user-selected weight can be assigned to each input calculation.

Abstract: A method and system for reporting quantitative measurement information includes forming a message with quantitative measurement information; converting the data format of the message to a data format which allows the message to be sent over a communication network; converting the data format of the message received over the communication network to a data format corresponding to that of a data recording system; and generating a report with the recording system using the quantitative measurement information contained in the message.