International Business Machines Corporation

Tom William Jacopi

Stephen Andrew Brodsky

Sonali Surange

Zeus Orion Courtois

Tony Kai-chi Leung

Anshul Dawra

Andreas Neumann

Michael Busch

Michael Yiupun Kwong

Rajesh M Desai

Sreeram Viswanath Balakrishnan

Jacques Labrie

Tony Leung

Michael Kyle McCandless

Brian Gerrit Payton

Shannon Matthew Farrington

Cheung-Yuk Wu

Thanh Vu Nguyen

Christopher John Hinrichs

Linnette M Bakow

Howard Alexander Siwek

Liem Gioi Tran

Diane Friedman

Provided are techniques for invoking with a processor executing on a computer a source code parser to obtain source information that includes a first location of an Application Programming Interface (API) call and parameters of the API call in source code of a client application, where the parameters the API call do not include query text for a query that is to be used to access a database; examining a stack trace to determine a second location of the API call in the stack trace; and deriving the query of the API call and a third location of the query in the source code by identifying the query in the stack trace at the location of the API call in the stack trace.

Correlating queries issued by applications with their source lines and analyzing applications for problem determination and where used analysis

Embodiments of the present invention provide a method, system and computer program product for maintaining distributed state consistency in a distributed computing application. In an embodiment of the invention, a method for maintaining distributed state consistency in a distributed computing application can include registering a set of components of a distributed computing application, starting a transaction resulting in changes of state in different ones of the components in the registered set and determining in response to a conclusion of the transaction whether or not an inconsistency of state has arisen amongst the different components in the registered set in consequence of the changes of state in the different ones of the components in the registered set. If an inconsistency has arisen, each of the components in the registered set can be directed to rollback to a previously stored state. Otherwise a committal of state can be directed in each of the components in the registered set.

Managing data consistency between loosely coupled components in a distributed computing system

Provided are techniques for collecting client information for client applications running on a client computer, wherein the client information includes a client application identifier for each client application that issues queries to a database along with text of each of the queries that the client application issues; collecting database monitoring information that includes text of each query issued against the database and performance information for each query; combining the client information and the database monitoring information based on the text of the queries to obtain combined information that provides the client application identifier and the performance information for each of the queries; and identifying a problem query and at least one client application that has issued the problem query using the combined information.

Client and database problem determination and monitoring

Techniques are disclosed for searching a plurality of documents using a dynamically defined ignore string. The ignore string may be specified by a user. An overlay index may be generated over the plurality of documents. The overlay index may include a posting list for each term in the ignore string. Each posting list may specify the documents of the plurality of documents in which the respective term occurs outside of the ignore string. The overlay index may also include a posting list that specifies all occurrences of the ignore string in the plurality of documents. Once generated, a user may search the plurality of documents while occurrences of the ignore string in the plurality of documents are ignored in text-based searches.

Searching documents using a dynamically defined ignore string

Techniques are disclosed for allowing efficient updating of metadata and high performance searching through the use of a text index and a separate updateable metadata index. Generally, an updateable metadata index is used to store document metadata. A text index is used to store document text. Documents in the text index are stored in the same order as the corresponding metadata entries. Upon receiving a search query, a search engine decomposes the query into a metadata condition and a text condition. Search engine performs a parallel scan upon the metadata index and the text index. To increase performance, metadata entries are skipped over if the corresponding text entries do not match the text condition. During the scan, when a document in the metadata index matches a document in the text index, the document is stored in the search results. After the scan, search results are displayed.

Adding low-latency updateable metadata to a text index

A multiple task wait system and associated method allow a client application to wait for multiple tasks to be successfully or conditionally implemented before running subsequent tasks. Two mechanisms can be used to accomplish this multiple wait process: The first mechanism uses a multi-wait grouping process that is visible to the client, and the second mechanism uses a graphical representation to identify the tasks to be completed. The multi-wait grouping process allows a client to group a related set of tasks together for both control and documentation purposes. The client can add as many tasks as the resources of the computer allow to a group while defining the data flows and control flows between the tasks in the group using various graphical tools. The multi-wait system allows the client to define the constraints and conditions for a set of tasks to be considered complete, and further allows the system to define the constraints and conditions for considering all the tasks within the group to be completed. By utilizing the group concept, the system can selectively control the tasks to be included in the completion decision based on predefined rules.

Multiple task wait system for use in a data warehouse environment

In a computerized database system, a query is formulated to retrieve data from the database by interactively identifying at least one table containing query data, and at least one column and at least one row in the identified table containing the query data. The rows are interactively identified using a condition statement. The condition statement is interactively formulated using at least one displayed flowline. Input is received from the user specifying a position on the flowline for insertion of a predicate and the predicate. The flowline is displayed with the predicate inserted in the specified location. The predicates are displayed on the flowline in between nodes. Predicates on the same flowline are combined through a logical AND operation. Predicates on different flowlines between the same nodes are combined through a logical OR operation. The flowline is converted to a corresponding Boolean algebra statement and displayed. Input from the user adding a predicate is received in the Boolean statement and is converted to a corresponding updated graphical flow representation.

System and method for interactively formulating database queries using

Growing community of inventors

San Jose, CA, United States of America

Tom William Jacopi