Abstract: The present invention provides a text searching method including the steps of: extracting initials of corresponding words in a text to be searched according to a predetermined extracting rule to form an initial character string; creating mapping relation between the extracted initial character string and the text to be searched; performing matching between the initial character string and an abbreviation character string to be searched for; and determining an expanded phrase corresponding to the abbreviation character string to be searched for and a location of the expanded phrase in the text to be searched according to a result of the matching and the mapping relation. The invention further provides a text searching device for implementing the method and a text processor including the text searching device.

Abstract: A method, device, and non-transitory computer-readable storage medium are provided for efficiently registering a relational schema. In co-compilation and data guide approaches, a subset of entities from schema descriptions are selected for physical registration, and other entities from the schema descriptions are not physically registered. In the co-compilation approach, a first schema description references a second schema description, and the subset includes a set of entities from the second schema description that are used by the first schema description. In the data guide approach, the subset includes entities that are used by a set of structured documents. In a pay-as-you-go approach, schema registration includes logically registering entities without creating relational database structures corresponding to the entities. A database server may execute database commands that reference the logically registered entities.

Abstract: This invention is generally directed to one or more systems or methods relating to social network analysis. More specifically, this invention is generally directed to one or more systems or methods relating to personal communication networks and the analysis of personal-communication-network data.

Abstract: Usage patterns of structure model are utilized to determine a personalized structure model associated with a user. The personalized structure model is constructed such that retrieval of data associated with the personalized structure model is expected to improve performance of retrieving data from the data provider. The personalized structure model may be arranged based on an order of retrieval, based on groups of structure objects that may be retrieved together or the like. The personalized structure model may be a flat structure model to further improve performance of retrieving data from the data provider.

Abstract: Data stored in a column-oriented manner is encoded using a data mining algorithm for finding column patterns among a set of data tuples, where each data tuple contains a set of columns, and the data mining algorithm treats all columns and all column combinations and column ordering similarly or in the same manner when looking for column patterns. Column values are ordered occurring in the column patterns based on their frequencies into a prefix tree, where the prefix tree defines a pattern order. The data tuples are sorted according to the pattern order, resulting in sorted data tuples, and columns of the sorted data tuples are encoded using run-length encoding.

Abstract: A system for analyzing performance data associated with a mail processing device includes a reporting module operable to receive, over a network, first data related to the operation of a mail processing device at one of a plurality of mail processing sites, wherein each of the plurality of mail processing sites is associated with a database accessible over the network, store the first data in a database associated with the mail processing site of the mail processing device, receive, over the network, second data identifying filter criteria for the first data, filter, using a processor, the first data with the second data, generate, using a processor, a report based on the filtered first data, and communicate the report over the network.

Abstract: A system and method for managing media advertising enterprise data. An enterprise data management (EDM) module can be configured to include a set of rules at an enterprise level to manage disparate and disconnected records. A scoring function with respect to each record can be computed based on the rules to determine the highest priority. The rules in association with the scoring function can be stored locally in an EDM database. A matching process can then be performed to accurately match similar records regardless of manual input, location, and format of the records in a distributed system. Each record can then be assigned with a parent enterprise advertiser. Such an optimization mechanism can interactively manage and report records at the enterprise level in a simple and efficient manner.

Abstract: Systems and methods dynamically form a context group that has a plurality of members and propagate payload data between the members. A database associates a context identifier (ID) of the context group with a user ID of each member. A context manager, communicatively coupled with the database, receives a join context request containing the context ID and a user ID from each said member, creates the context group, if not existing, within the database in response to the join request, and adds the user ID, if not existing, of each said member to the database in association with the context ID. A payload handler receives payload data from one of said members and propagates the payload data to other said members of the context group.

Abstract: In one aspect, a method includes replicating a storage entity which is not accessible though a storage area network by using a data protection appliance (DPA) coupled to a storage area network and a data protection agent installed on a host which can access the storage entity. In another aspect, a non-transitory machine-readable medium stores executable instructions. The instructions cause a machine to replicate a storage entity which is not accessible though a storage area network by using a data protection appliance (DPA) coupled to a storage area network and a data protection agent installed on a host which can access the storage entity.

Abstract: Described is using context information obtained from entity mentions in likely relevant documents to extract entity mentions from documents that are ambiguous with respect to their relevance to a domain. A list of entities is input into an entity extraction mechanism, which processes a large collection of documents to determine data (counts) corresponding to frequency of entity mentions. Infrequently mentioned entities are specific entities, while frequently mentioned entities are non-specific (generic or ambiguous) entities. The context surrounding mentions of the specific entities is processed to obtain interesting context terms (words, phrases or both) for the domain. The interesting context terms are then compared against the contexts of non-specific entity mentions to determine whether each non-specific entity mention is relevant to the domain. A result set containing only relevant documents or relevant mentions collection is output.

Abstract: Architecture for handling large data selections with small and substantially constant memory footprints. The architecture facilitates the creation of sets of data objects (e.g., rows) of a data source based on selection of the data objects. The set structures can be defined according to a range (span) of data objects selected and a pattern of the objects selected. These set structures are then saved in memory, rather than the data objects, to provide optimized memory usage. In a database implementation, the solution stores the set representation (the structure) in nearly a constant amount of memory, regardless of the number of rows in the grid, and regardless of the number of rows selected. Memory usage can be proportional to the number of discontinuous spans of rows selected by the user. Structures in memory can be consolidated, replaced, or eliminated dynamically as the user changes row selections and pattern criteria.

Abstract: Technologies are described herein for performing data de-duplication of a version of a data file for backup to a remote storage location. A CDP module executing on a computer creates a collection of files corresponding to the version of the data file by de-duplicating the version against a previous version master file stored locally on the computer. The previous version master file contains one or more unique data blocks of a specific block size from a previous version of the data file. Once the de-duplication against the locally maintained previous version master file is complete, the CDP module stores the collection of files corresponding to the version of the data file to the remote storage location. The remote storage location also contains a master file corresponding to the data file that contains all of the unique data blocks in the previous version master file.

Abstract: A method, system and computer program product for retrieving information from a relational database using user defined facets in a faceted query may include receiving a faceted query and receiving at least one user defined facet group query. The method may also include filtering out facets in the faceted query that relate to metadata in the relational database. The method may additionally include associating each remaining facet in the faceted query with a corresponding user defined facet group query of the at least one user defined facet group query to provide a set of user defined facet groups. An SQL query may be generated for the faceted query using the set of user defined facet groups. Information from the relational database may be retrieved responsive to the SQL query.

Abstract: Managing a concurrency based system. A method includes determining a defined number of concurrent operations for a concurrency based management system. An operation queue is accessed. The operation queue stores or has therein zero or more asynchronous operations. An asynchronous operation is an operation that returns an object representing the asynchronous completion of the operation. The method further includes, as long as the queue is not empty, scheduling asynchronous operations from the queue until a number of asynchronous operations equal to the defined number has been reached.

Abstract: The present invention provides a federated search tool and search methods that consolidate searches to external online accounts of a user and other people that are part of the user's social network. In some embodiments, the search tool is presented as a single search box that may appear persistently on the user's desktop display or as a toolbar embedded within another application. The search tool may be embedded as part of web page. Embodiments of the present invention may provide the results in a simple real-time display stack or a static result list, such as a web page. Blocks in the stack may indicate a result and the context of the result, such as which online account originated the result, whether the result is from a linked external accounts of people associated with the user, pointers to people and groups the user has linked to, an age of the result, and the like.

Abstract: Computer-implemented systems and associated operating methods create and use an operator map to identify and evaluate database query plan robustness landmarks. The computer-implemented system comprises logic that creates a map evaluating performance of an implementation of a database engine operator during execution under actual operating conditions. The logic measures and maps performance for a selected range of runtime conditions including resource availability and data characteristics.

Abstract: A method, system, and computer program product for optimizing query evaluation and processing services in a subscription notification system are provided. The method includes determining hierarchical relationships among a set of subscription queries received from subscription client systems. The hierarchical relationships are determined by identifying subscription queries that are subsets of corresponding other subscription queries in the set. The method also includes creating at least one subscription query at a notification source, the at least one subscription query corresponding to one or more selected subscription queries in the set and including any corresponding subsets.

Abstract: A system may create work units, each work unit including at least one of an input port or output port, each work unit configured to modify data that is received via the input port. In addition, the system may compose a workflow by connecting an output port of a first of the work units to an input port of a second of the work units, receive a work order, select the workflow in response to the work order, decompose the workflow into constituent work units, instantiate tasks that correspond to the constituent work units, and execute a work unit process for each of the tasks.

Abstract: A request to store a data object is received at a hosted storage service. The request includes the data object and an associated object reference. The object reference configured to enable retrieval of the data object from the hosted storage service. The data object is stored at the hosted storage service in association with the object reference. The data object is sent from the hosted storage service to a content delivery network node such that the data object is cached in and retrievable from the content delivery network node using the object reference.

Abstract: A system and method for injecting a node into a data description of an electronic form are provided. In one embodiment, the system comprises a request detector, an injection tool, a template module, and a storing module. The request detector may be configured to detect a request to include a new form object into an electronic form. The injection tool may be configured to determine that the data schema does not accommodate the new form object, and to automatically modify the data description by adding a node that is associated with the new form object. The template module may be configured to add the new form object into the electronic form to create a modified electronic form. The modified electronic form comprises the modified data description, while the data schema upon which the electronic form was originally based may remain unchanged.