International Business Machines Corporation

Todd L Leyba

Barton Wayne Emanuel

David Allen Schell

Ronny Lempel

John A McPherson, Jr

Justo Luis Perez

Amit Radheshyam Somani

Marvin Addink

Andrew W Holmes

Arthur Choi

Carolyn A Till

John J Mullen

Beate Porst

Cheney Y Hu

Provided are a computer program product, system, and method for generating visualizations of facet values for facets defined over a collection of objects. The objects are processed to determine facet values for the objects for a specified facet. A first visualization is generated of representations of the determined facet values for the objects. User selection is received of one of the facet values represented in the generated first visualization. A determination is made of objects having the user selected facet value and a determination is made of at least one facet value for the specified facet for each of the determined objects having the selected facet value. A second visualization of representations of the determined at least one facet value is generated.

Generating visualizations of facet values for facets defined over a collection of objects

Provided are techniques for providing and using pivot facets for text mining and search. A metadata field is mapped to a pivot facet. In response to executing a first query, at least a first document and the pivot facet are displayed. In response to selection of the pivot facet, a second query that includes a value of the metadata field is generated, and the second query is executed to locate at least a second document that includes the value of the metadata field.

Pivot facets for text mining and search

According to one embodiment of the present invention, a system searches content managed by a search engine. The system receives a relational database type query, translates the relational database type query into a query for the search engine, and submits the translated query to the search engine to retrieve information. The system formats resulting information from the search engine into a relational database query result set. Embodiments of the present invention further include a method and computer program product for searching content managed by a search engine in substantially the same manners described above.

Searching content managed by a search engine using relational database type queries

Techniques are disclosed for analyzing a 'context window' of a search query to determine a semantic meaning of a search word and to filter search results based upon the semantic meaning. Generally, a lexicon may be used to store forms, meanings, and usages of words and phrases. When a user specifies a query, a semantic analyzer obtains all of the word senses for a search word. The semantic analyzer applies lexical analysis techniques to the search word and context window to obtain a total score for each word sense and selects the word sense with the highest total score. After query results such as documents containing the search words are obtained, the semantic analyzer applies lexical analysis techniques to filter the results so that only documents which use the search terms, according to the selected word sense are returned.

Semantic search by means of word sense disambiguation using a lexicon

Techniques are provided for processing a search request. One or more indexed levels of access control list information are stored in a search index for each document identified in the search index. An interim result set is generated by matching the one or more indexed levels of access control list information associated with each said document to one or more security groups associated with the search request. A final result set is generated from the interim result set by performing impersonation.

Enforcing native access control to indexed documents

Method, system, and program product for searching unstructured data. The unstructured data, as text data or image data, is searched by first searching the unstructured data through an extended search broker. The extended search broker has intermediary components between a search requestor and a search agent for unstructured data searching. The search agent returns the search results to the broker for aggregation. The broker aggregates the search results and returns the search results to a wrapper. The wrapper then takes result attributes from the aggregated search results and makes the attributes available, e.g., as one or more columns in a nickname table. This nickname table is searchable by a relational database using a structured query language.

Real-time aggregation of unstructured data into structured data for SQL processing by a relational database engine

A method for displaying information in a virtual reality environment in which an object that is displayed within a viewport into the virtual reality environment is selected so that the contents of the object can be displayed. The object is opened and the contents of the object are automatically oriented to be perpendicular to a line of sight of the viewport.

Method for displaying information in a virtual reality environment

A plurality of users in a virtual reality environment are registered over a network to share information. A three dimensional representation of information to be shared over the network is placed into a shared area of the virtual reality environment. The information is then transferred to all of the registered users. The registered users may be listed on a whiteboard visible to all in the environment. The information to be shared may be placed onto a conference table metaphor to indicate it is available for all registered users.

Method and system for sharing information in a virtual reality world

An improved method manages the storage of document images so as to minimize the average access time while minimizing overall storage costs, consistent with the probable usage of the documents for a particular application. Document images can be selectively stored on high speed, low capacity magnetic DASD or alternately on low speed, high capacity optical storage. DASD storage is more expensive than optical storage for a document image. By characterizing the probable use of a document image in association with a case processing work flow within which the document image is to participate, optimum document storage can be achieved. When a case has a predefined plurality of document image types, and a particular document image type is missing, the case can be placed in a pending state while awaiting the receipt of the missing document image. In the pending state, the documents which are members of the pended case can be removed from the DASD and retained on the optical storage device. A notation as to the missing document type is associated with the pended case. When the missing document type is received, the case of which it is to be a member, is reactivated by accessing the existing documents for the case from the optical storage and transferring them to the DASD, along with storing the newly received missing document. The case with its full complement of documents is then made available to the user. Provision is made for prohibiting the deletion of a document image from the DASD when other active cases have that document as a member.

Growing community of inventors

Montgomery Village, MD, United States of America

Todd L Leyba