Abstract: Embodiments of the present invention disclose a method, computer program product, and system for searching a database using a user entered search query. A search query for a database is received by the computer and the computer applies condition-action rules based on natural language processing rules to identify one or more phrases within the search query that is associated an entity identifier. The computer further identifies any taxonomy variants that have been established for the identified phrases. The computer creates a search string that includes search query and the entity identifiers. The database search is conducted by the computer and the results are displayed for the user.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for searching a database using a user entered search query. A search query for a database is received by the computer and the computer applies condition-action rules based on natural language processing rules to identify one or more phrases within the search query that is associated an entity identifier. The computer further identifies any taxonomy variants that have been established for the identified phrases. The computer creates a search string that includes search query and the entity identifiers. The database search is conducted by the computer and the results are displayed for the user.

Abstract: Techniques are disclosed for generating a unified ranking of search results received from a plurality of distinct search resources. A computing system executing a federated search application receives a set of ranked search results from multiple search resources (e.g., web-based search engines, public databases and catalogs, etc.). Each search result identifies an item and includes metadata characterizing the item. The federated search application determines a unified ranking for the items identified in the search results that preserves a relative ranking of each set of items, such that a result for a given item is ranked above other results for items in the associated set of items is ranked above the other results in the unified ranking.

Abstract: Techniques are disclosed for generating a unified ranking of search results received from a plurality of distinct search resources. A computing system executing a federated search application receives a set of ranked search results from multiple search resources (e.g., web-based search engines, public databases and catalogs, etc.). Each search result identifies an item and includes metadata characterizing the item. The federated search application determines a unified ranking for the items identified in the search results that preserves a relative ranking of each set of items, such that a result for a given item is ranked above other results for items in the associated set of items is ranked above the other results in the unified ranking.

Abstract: Embodiments presented herein provide a protocol for throttling requests of multiple client applications sending data to a server. When a server receives a request from a client, the server increments a counter. Based on the counter value with respect to a high-water mark value and a low-water mark value, the server may enter a throttling period, upon which the server sends acknowledgments that include a throttle identifier to requesting clients. When a client receives an acknowledgment with a throttle identifier, the client waits for a delay period before sending a subsequent request. The server continues to send acknowledgments with a throttle identifier while in the throttling period. The client increases the delay period each time it receives an acknowledgment with the same throttle identifier as the previous one.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for searching a database using a user entered search query. A search query for a database is received by the computer and the computer applies condition-action rules based on natural language processing rules to identify one or more phrases within the search query that is associated an entity identifier. The computer further identifies any taxonomy variants that have been established for the identified phrases. The computer creates a search string that includes search query and the entity identifiers. The database search is conducted by the computer and the results are displayed for the user.

Abstract: Techniques are disclosed for generating a unified ranking of search results received from a plurality of distinct search resources. A computing system executing a federated search application receives a set of ranked search results from multiple search resources (e.g., web-based search engines, public databases and catalogs, etc.). Each search result identifies an item and includes metadata characterizing the item. The federated search application determines a unified ranking for the items identified in the search results that preserves a relative ranking of each set of items, such that a result for a given item is ranked above other results for items in the associated set of items is ranked above the other results in the unified ranking.

Abstract: Techniques are disclosed for generating a unified ranking of search results received from a plurality of distinct search resources. A computing system executing a federated search application receives a set of ranked search results from multiple search resources (e.g., web-based search engines, public databases and catalogs, etc.). Each search result identifies an item and includes metadata characterizing the item. The federated search application determines a unified ranking for the items identified in the search results that preserves a relative ranking of each set of items, such that a result for a given item is ranked above other results for items in the associated set of items is ranked above the other results in the unified ranking.

Abstract: Embodiments presented herein provide a protocol for throttling requests of multiple client applications sending data to a server. When a server receives a request from a client, the server increments a counter. Based on the counter value with respect to a high-water mark value and a low-water mark value, the server may enter a throttling period, upon which the server sends acknowledgments that include a throttle identifier to requesting clients. When a client receives an acknowledgment with a throttle identifier, the client waits for a delay period before sending a subsequent request. The server continues to send acknowledgments with a throttle identifier while in the throttling period. The client increases the delay period each time it receives an acknowledgment with the same throttle identifier as the previous one.