Abstract: A method is performed on a handheld device that involves receiving a search term and searching through stored text message information of multiple text messages for the search term. A listing of text message conversations are listed on the display where each listed conversation has at least one text message whose text message information was found to include the search term. And, in response to a user selection of one of the conversations, a sequence of text messages within the one selected conversation is displayed.

Abstract: Embodiments of the present invention provide a database processing system for efficient partitioning of a database table with column-major layout for executing one or more join operations. One embodiment comprises a method for partitioning a database table with column-major layout, partitioning only the join-columns by limiting the partitions by size and number, executing one or more join operations for joining the partitioned columns, and optionally de-partitioning the join result to the original order by sequentially writing and randomly reading table values using P cursors.

Abstract: Methods and apparatus related to associating a task with a user based on the user selecting a task suggestion that is provided to the user in response to a user query. In some implementations, the task may be identified based on similarities between the words and/or phrases of the user query and a task suggestion that is associated with a task. In some implementations, the task may be identified based on user data associated with the user. In some implementations, the task may be associated with additional information related to completing the task.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for rebalancing partitioned data based, at least in part, on one or more characteristics of the plurality of database partitions. The computer updating characteristics, wherein the one or more characteristics include one or both of a) an average number of records per partition, and b) an average number of unique limit key values per partition. Embodiments of the present invention disclose a method, computer program product, and system for limit key extrapolation in a database. Responsive to a determination that the upper limit key value of the last loaded record is greater than the first upper limit key value of the first empty partition, the computer redefines the first upper limit key value of the first empty partition by an extrapolated upper limit key value based, at least in part, on the range of limit key values.

Abstract: Source values are mapped to new user-defined categories. The new user-defined categories are stored in a new user-defined field. In an embodiment, a user-selection of an existing field is received. Based on a data type of the existing field, a specific mapping interface is displayed. The interface guides the user through specification of the new field and categories, and identification of the source values to map to the new categories.

Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage system. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. Matching digests of previously constructed synthetic backups are located in the digests index. Each of the located matching digest references stored data are included in the synthetic backup, and the stored data is similar to the input backup data. Data matches are found in the input backup data and data in the synthetic backup.

Abstract: A deduplication storage system and a backup application create a synthetic backup. Metadata instructions are provided to the deduplication storage system. Each of the metadata instructions specifies the data segment of an originating backup and a designated location of the data segment in the synthetic backup. A set of metadata instructions is transformed into a transformed set of metadata instructions.

Abstract: Methods and apparatus to de-duplicate impression information are disclosed. An example method to de-duplicate media impression information includes determining an overlap between cookies of a first database proprietor and cookies of a second database proprietor on client computers; determining duplicate impression information based on first impression information associated with the first database proprietor, second impression information associated with the second database proprietor, and the overlap; and determining unduplicated impression information based on the duplicate impression information, the first impression information, and the second impression information.

Abstract: Disclosed are various embodiments for navigating a taxonomy using search queries. An unstructured search query is parsed in order to identify one or more categories of a taxonomy of a collection of items. Each one of the one or more categories is associated with a confidence score. When the confidence score meets a threshold, a pool of items is selected from a respective one of the one or more categories. When no confidence score meets the threshold, the pool of items is selected from the collection of items.

Abstract: Systems and methods are disclosed herein for downloading data from a cloud system. A plurality of files on the cloud system is identified for downloading to a client system, where the plurality of files is associated with metadata. A respective score for each file in the plurality of files is evaluated by applying a ranking scheme to the metadata, where the ranking scheme is based on at least two features of the metadata. A download process is initiated for at least some files in the plurality of files based on each file's respective score.

Abstract: The present disclosure discloses a method and apparatus for mining community users, belonging to the field of Internet communications. The method includes: acquiring original community data of a community user; calculating intimacy scores of the community user with respect to other community users according to the original community data of the community user, the intimacy scores being used for indicating degrees of intimacy of the community user with respect to the other community users; clustering the community users according to the intimacy scores of the community user with respect to the other community users, and forming a community user circle; and displaying the community user circle to community users in the community user circle, so that the community users in the community user circle communicate with each other. The apparatus includes: a first acquiring module, a calculation module, a clustering module, and a display module.

Abstract: In one embodiment, a server-side process operating on a server includes crawling of one or more websites for possible answers to a query and adding the possible answer entities into a data structure of answer entities to queries. The server-side process also includes serving a requested Web page with an added search box that is displayed by a client coupled to the server. As a user types one or more characters at the client, the client sends the characters, portion-by-portion, e.g., character-by-character to the server-side process. In response, the server-side process searches the index for possible answers to the (so-far-typed) query, and provides to the client a list of answers (rather than queries) to be displayed by the client. Each additional character entered may modify the provided list of answers. The client selecting a listed answer navigation directly to the answer.

Abstract: A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database join, especially using parallel execution techniques.

Abstract: A system, a method, and a computer program product for managing questioning in a Question and Answering (QA) system are disclosed. An input question received by the QA system is analyzed to determine the set of answer-types. A set of answer-types is determined. Prompting for clarifying data associated with the input question happens. A set of candidate answers of the answer-type is determined. The clarifying data is used to determine the set of candidate answers. At least one candidate answer of the set of candidate answers of the answer-type is provided.

Abstract: A system, a method, and a computer program product for managing questioning in a Question and Answering (QA) system are disclosed. An input question received by the QA system is analyzed to determine the set of answer-types. A set of answer-types is determined. Prompting for clarifying data associated with the input question happens. A set of candidate answers of the answer-type is determined. The clarifying data is used to determine the set of candidate answers. At least one candidate answer of the set of candidate answers of the answer-type is provided.

Abstract: A dynamical hierarchical tagging system connected to a user site through a remote communications network. The system may comprise a master controller, a job management server connected to the master controller, one or more scanners in communication with the job management server, wherein the one or more scanners are configured to scan for one or more user assets located at the user site, resulting in scan results, a scan logic processor connected to the master controller, wherein the scan logic processor is configured to store the scan results in a user database, a tagging logic engine connected to the master controller, wherein the tagging logic engine is configured to tag the scan results stored in the user database, and an indexing logic processor connected to the master controller, wherein the indexing logic processor is configured to search and index the tagged scan results stored in the user database.

Abstract: Disclosed is an improved method, system, and computer program product for analyzing interests of consumers, where semantic analysis is performed on writings by authors on social media sites. The results of the semantic analysis provide a profile of the authors. These author profiles can be used to identify and correlate topical interests by consumers. An enterprise or business can more effectively market to the consumers based upon this knowledge of the consumers' interests.

Abstract: There is provided a computer-implemented method of dynamically reordering operations in a query plan. An exemplary method comprises processing a first set of tuples according to a first operation. The query plan is pipelined and specifies that the first operation generates input for a second operation. The query plan further specifies that the second operation is executed after the first operation. The computer-implemented method further includes determining that the second operation is to precede the first operation based on a specified policy. The computer-implemented method further includes executing the second operation for a second set of tuples before executing the first operation for the second set of tuples. The second operation generates an input for the first operation. The first operation is executed after the second operation.

Abstract: A usage model and the underlying technology used to provide sequence analysis as part of a relational database system. Included components include the semantic and syntactic integration of the sequence analysis with an existing query language, the storage methods for the sequence data, and the design of a multipart execution scheme that runs the sequence analysis as part of a potentially larger database join, especially using parallel execution techniques.

Abstract: Expertise mining features are provided based in part on the use of an expertise mining algorithm and expertise mining queries. A method of an embodiment operates to provide an expanded feedback query based in part on search results using an expertise mining query and a number of author-ranking heuristics used to rank authors and/or co-authors (e.g., primary authors, secondary authors, etc.) as part of an expertise mining operation. A search system of an embodiment includes an author ranker component to rank authors based in part on an expertise mining query and author-ranking heuristics, and a query expander component to provide expanded queries as part of identifying relevant search results. Other embodiments are also disclosed.