International Business Machines Corporation

Nithya Rajamani

Murthy V Devarakonda

Yu Deng

Rafah A Hosn

Norbert George Vogl

Ruchi Mahindru

Mudhakar Srivatsa

Soumitra Sarkar

Aruna Rajan

Wlodek Wlodzimierz Zadrozny

Daniel Manuel Dias

Vijay Krishnarao Naik

Giovanni Pacifici

Daniela Rosu

James Rubas

Graeme Neville Dixon

A method, system and computer program product are disclosed for searching for data. In one embodiment, the invention provides a method comprising identifying a query and a search scope including a set of specified entities; and for each of these entities, estimating a number of documents that would be identified in a search through the entity to answer the query. On the basis of this estimating, a subset of the entities is formed. The query and this subset of entities are sent to a search engine to search the subset of entities to answer the query. In one embodiment, the estimating includes collecting statistical information from queries to build up a historical cache using heuristics or machine learning techniques, wherein the query includes a key word and a scope, and the historical cache contains a maximum number of returned results for an entity given the queries executed.

Using historical information to improve search across heterogeneous indices

A method, system, and computer program product are disclosed for merging search results. In one embodiment, the method comprises identifying a query, splitting the query into sub-queries, and calculating information content for each of the sub-queries. This method also comprises executing each of the sub-queries to obtain a plurality of search results, and combining the search results based on the information content calculated for the sub-queries. In an embodiment, the execution of each of the sub-queries includes identifying a multitude of search results for at least one of the sub-queries; and the combining includes grouping said multitude of search results into a plurality of clusters, and computing a relevance score for each of said clusters. In the embodiment the combining further includes merging the clusters based on the relevance scores computed for the clusters as well as the information content calculated for the sub-queries.

Information theory based result merging for searching hierarchical entities across heterogeneous data sources

A method and system for prioritizing accounts is provided. The method includes receiving operational metrics and data values associated with the operational metrics. The data values are aggregated and noisy data is removed from the operational metrics. Statistical averages associated with a performance of accounts are calculated and each account is modeled as a collection of operational performance variables and key performance indicators A ranking list is generated and a minimum number of independent operational parameters necessary are calculated. Pairwise ranks {r} of the accounts are calculated and values associated with a tolerance limit epsilon and selected.

Prioritizing client accounts

Techniques for providing at least one user access to one or more documents in a collaborative computing environment in accordance with a search engine are provided. The user is presented with search results, wherein the search results comprise at least one document comprising at least one portion to which the user has no access. A request from the user for access to the at least one document is received. A supervising entity is then notified of the user request to access the at least one document. An instruction from the supervising entity is then received. In accordance with the received instruction, the user is granted access to the at least one document.

Real-time interactive authorization for enterprise search

One embodiment of the present method and apparatus for performance and policy analysis in distributed computing systems includes representing a distributed computing system as a state transition model. A queuing network is then superimposed upon the state transition model, and the effects of one or more policies on the distributed computing system performance are identified in accordance with a solution to the queuing network.

Method and apparatus for performance and policy analysis in distributed computing systems

A system for prioritizing accounts is provided. The method includes receiving operational metrics and data values associated with the operational metrics. The data values are aggregated and noisy data is removed from the operational metrics. Statistical averages associated with a performance of accounts are calculated and each account is modeled as a collection of operational performance variables and key performance indicators A ranking list is generated and a minimum number of independent operational parameters necessary are calculated. Pair wise ranks {r} of the accounts are calculated and values associated with a tolerance limit epsilon and selected.

Techniques for selectively off-loading workload across multiple data centers are disclosed. For example, a technique for processing a user request in accordance with a multiple data center environment comprises the following steps/operations. A user request is obtained at a first data center. The user request is classified based on one or more classification criterion. At least a portion of a workload associated with the classified user request is off-loaded to at least a second data center to be processed, wherein the off-loading step/operation is at least based on one or more administrative policies associated with at least one of the first data center and the second data center. The workload is processed such that the user request is at least substantially satisfied in accordance with a service level agreement for the requesting user.

Growing community of inventors

Tarrytown, NY, United States of America

Nithya Rajamani