Abstract: Systems, methods, and computer program products to perform an operation comprising identifying, in a first thread comprising a plurality of messages outputted for display on a display device, a first concept in a text of a first message of the plurality of messages, identifying a second concept in a text of a second message of the plurality of messages of the first thread, upon determining that the second concept is different than the first concept, generating a second thread comprising a subset of the plurality of messages, wherein each message in the subset of the plurality of message is related to the second concept, and outputting, based on a set of user preferences, the subset of the plurality of messages of the second thread for display on the display device.

Abstract: Systems, methods, and computer program products to perform an operation comprising identifying, in a first thread comprising a plurality of messages outputted for display on a display device, a first concept in a text of a first message of the plurality of messages, identifying a second concept in a text of a second message of the plurality of messages of the first thread, upon determining that the second concept is different than the first concept, generating a second thread comprising a subset of the plurality of messages, wherein each message in the subset of the plurality of message is related to the second concept, and outputting, based on a set of user preferences, the subset of the plurality of messages of the second thread for display on the display device.

Abstract: Personalizing travel route planning based on past actual user travel behavior and reasons that the user deviated from planned routings. The route planning algorithm is revised based on analysis of user input related to a deviation from a planned routing. If a new trip in the planning stage entails considerations similar to those that caused the user's deviation on a previous trip, then the revised route planning algorithm can take these considerations into account when planning the route for the new trip. Changes in route planning may apply when the user: (i) plans to make a trip similar to a previous trip when the deviation occurred; (ii) plans to make a different trip, but the trip entails considerations that lead to the deviation on the prior trip; (iii) is using the same vehicle as for the previous trip with the deviation; and/or (iv) is using a different vehicle.

Abstract: Personalizing travel route planning based on past actual user travel behavior and reasons that the user deviated from planned routings. The route planning algorithm is revised based on analysis of user input related to a deviation from a planned routing. If a new trip in the planning stage entails considerations similar to those that caused the user's deviation on a previous trip, then the revised route planning algorithm can take these considerations into account when planning the route for the new trip. Changes in route planning may apply when the user: (i) plans to make a trip similar to a previous trip when the deviation occurred; (ii) plans to make a different trip, but the trip entails considerations that lead to the deviation on the prior trip; (iii) is using the same vehicle as for the previous trip with the deviation; and/or (iv) is using a different vehicle.

Abstract: A method and system for sharing search index entries across multiple computer systems organized in a peer to peer network, in which unique content is indexed only once, even though the content may be physically duplicated in multiple computer systems in the peer to peer network. When files are obtained by a shared indexing service, and a determination is made as to whether the received files are duplicates with regard to previously indexed files. If a file is determined to be a duplicate, the index representation of the previously indexed copy of the file is modified to indicate that the file is also associated with another computer system in the peer to peer network. If a file is not a duplicate of a previously indexed file, the file is indexed to support future searches. The index representation of a file includes category identifiers associating one or more computer systems with the file. When a file is indexed, one or more category identifiers are generated and stored in association with that file.

Abstract: A method and system for sharing full text index entries across application boundaries in which documents are obtained by a shared, platform level indexing service, and a determination is made as to whether the received documents are duplicates with regard to previously indexed documents. If a document is determined to be a duplicate, the index representation of the previously indexed copy of the document is modified to indicate that the document is also associated with another application or context. If a document is not a duplicate of a previously indexed document, the document is indexed to support future searches and/or other processing. The index representation of a document includes application category identifiers associating one or more applications or contexts with the document. When a document is indexed, one or more category identifiers are generated and stored in association with that document.

Abstract: When a message having at least one attachment is obtained for indexing, it is indexed as N+1 separate documents, where N is the number of attached documents. If the message is part of a message thread, then information regarding the last message in the thread is retrieved, and search index attachment meta data for the last message is extracted. A unique identifier is computed for the newly obtained attachments, and used to search for matches in the attachments for the last message in the thread. If there is a match, then the newly obtained attachment is not indexed, but the unique identifier of the previously indexed matching attachment is added to a body index document for the new message. A unique identifier associated with the new message is also added to a list of parent identifiers associated with the attachment.

Abstract: A system and a method for providing user interest based search index optimization. The system includes a server node configured to transmit electonic mail, and a client node having an electronic recepticle and a dynamic interest profile member (DIP). The client node is interconnected to the server node via a network. The client node is configured to receive in the electronic receptacle the transmitted electronic mail. The DIP is configured to assign a DIP ranking to each piece of received electronic mail predicated upon at least one of, (i) the identity of the sender, and (ii) the keywords listed in the contents of the electronic mail. The DIP ranking of the electronic mail is compared to a DIP threshold; the electronic mail is added to a full text index located in the client node when the DIP ranking of the electronic mail exceeds the DIP threshold.