Abstract: A method for ontologically driving context mediation in a computing system can include collecting events arising from a solution in a computing environment, loading operational meta-data for the solution, contextually mediating, for example context interchange (COIN) mediating, the collected events with the operational meta-data to produce context sensitive events, and correlating the context sensitive events with corresponding symptoms in a display to an end user in the computing environment.

Abstract: A method, computer program product, and a data processing system that facilitates navigation through a directed graph for selection of sub-processes of a modified business process derived from a business process is provided. A bounding box is used for evaluating and selecting sequences of nodes representative of business sub-processes or services. The bounding box has a predefined depth for limiting the scope of the evaluation. The bounding box is shifted during the evaluation as sequences of nodes are selected. Additionally, state data is maintained such that a sense response model may be employed to detect and account for changes to the environment in previously evaluated services. By maintaining state data, a transition to a previously evaluated sub-process may be implemented to account for significant changes in the environment.

Abstract: A method for ontologically driving context mediation in a computing system can include collecting events arising from a solution in a computing environment, loading operational meta-data for the solution, contextually mediating, for example context interchange (COIN) mediating, the collected events with the operational meta-data to produce context sensitive events, and correlating the context sensitive events with corresponding symptoms in a display to an end user in the computing environment.

Abstract: Techniques are disclosed for efficiently analyzing measurement data for business processes (for example, in a service provider environment). Business process-aware modules or “cubes” are created from the measurement data, using features of a spatially-enabled database system. A “drill-down” approach is provided for investigating underlying information for a cube (including lower-level linked cubes). Data types other than cubes, such as planes from which a cube is constructed, may also be analyzed. The disclosed techniques may be used to provide autonomic systems, which are self-aware, at a business process level. That is, based on results of analyzing data represented by a cube, autonomic adjustments may be made. In a service provider environment, the analysis and/or the autonomic adjustments may be directed toward enabling the service provider to avoid jeopardizing commitments in service level agreements (and the revenue loss that may result when the commitments are not met).

Abstract: Techniques are disclosed for mapping display space (for example, for display devices) using extensions to spatially-enabled databases. Built-in structures and functions of a spatially-enabled object relational database system can therefore be leveraged. Use of the disclosed techniques enables, for example, quickly determining whether one object to be displayed on the display of a computing device will overlap (in space and/or in time) another object to be displayed on that device.

Abstract: Techniques are disclosed for adapting point geometry for storing address density information. Preferred embodiments store this density information in a 4-dimensional point data type provided by a spatially-enabled object relational database system, and leverage built-in functions and data types of the database system for operating on the data type. The address density may be computed while processing address data which is presented in textual format, or alternatively, from street geometry data which has been derived from such address data. The address density may be used in many different applications, such as e-business, targeted advertising, urban planning, facilities enhancements, and so forth. The point geometry representation of the street density information supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements.

Abstract: Techniques are disclosed for using geographical taxonomy data in network-accessible registries (such as the Universal Description, Discovery, and Integration, or “UDDI”, registry), where this taxonomy data leverages spatial extenders within spatially-enabled databases. Built-in functions of a spatially-enabled object relational database system can then be used for entries in the network-accessible registry.

Abstract: Technics are disclosed for programmatically calculating directions (or other types of paths between points) without reliance on proprietary file formats or binary shape files, and without requiring application programmers to write code that performs complex manipulations of directed graphs. Preferred embodiments leverage built-in functions of a spatially-enabled object relational database system. Information about intersections between streets is used in a novel manner to compute paths between points. The intersection information is preferably obtained from precomputed information stored in a spatially-enabled relational database table.

Abstract: Techniques are disclosed for programmatically deriving street intersections from address data which is presented in textual format, or alternatively, from street geometry data which has been derived from such address data. Preferred embodiments leverage built-in functions and data types of a spatially-enabled object relational database system. Information about streets is analyzed to determine which streets intersect, as well as the intersection locations. This information is stored in a spatially-enabled table for subsequent retrieval. The derived street intersections data supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements. The derived street intersection information may be used in many ways, such as to compute a path from one location to another.

Abstract: Techniques are disclosed for programmatically calculating directions (or other types of paths between points) without reliance on proprietary file formats or binary shape files, and without requiring application programmers to write code that performs complex manipulations of directed graphs. Preferred embodiments leverage built-in functions of a spatially-enabled object relational database system. Information about intersections between streets is used in a novel manner to compute paths between points. The intersection information is preferably obtained from precomputed information stored in a spatially-enabled relational database table.

Abstract: Techniques are disclosed for mapping display space (for example, for display devices) using extensions to spatially-enabled databases. Built-in structures and functions of a spatially-enabled object relational database system can therefore be leveraged. Use of the disclosed techniques enables, for example, quickly determining whether one object to be displayed on the display of a computing device will overlap (in space and/or in time) another object to be displayed on that device.

Abstract: Techniques are disclosed for using geographical taxonomy data in network-accessible registries (such as the Universal Description, Discovery, and Integration, or “UDDI”, registry), where this taxonomy data leverages spatial extenders within spatially-enabled databases. Built-in functions of a spatially-enabled object relational database system can then be used for entries in the network-accessible registry.

Abstract: Techniques are disclosed for programmatically deriving street geometry data from address data which is presented in textual format. A collection of address information is used as input, and is processed in a novel manner to populate tables of a spatially-enabled database. Preferred embodiments use a data mart schema which is disclosed, and leverage built-in functions of a spatially-enabled object relational database system. In contrast to prior art techniques, the present invention does not require input data to be encoded in a “well-known” format (i.e. a format that adheres to particular predefined syntax conventions known as “WKT” or “WKB”); rather, textual information of the type which is readily available from government and/or commercial sources may be used as input.

Abstract: Techniques are disclosed for adapting point geometry for storing address density information. Preferred embodiments store this density information in a 4-dimensional point data type provided by a spatially-enabled object relational database system, and leverage built-in functions and data types of the database system for operating on the data type. The address density may be computed while processing address data which is presented in textual format, or alternatively, from street geometry data which has been derived from such address data. The address density may be used in many different applications, such as e-business, targeted advertising, urban planning, facilities enhancements, and so forth. The point geometry representation of the street density information supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements.

Abstract: Techniques are disclosed for programmatically deriving street geometry data from address data which is presented in textual format. A collection of address information is used as input, and is processed in a novel manner to populate tables of a spatially-enabled database. Preferred embodiments use a data mart schema which is disclosed, and leverage built-in functions of a spatially-enabled object relational database system. In contrast to prior art techniques, the present invention does not require input data to be encoded in a “well-known” format (i.e. a format that adheres to particular predefined syntax conventions known as “WKT” or “WKB”); rather, textual information of the type which is readily available from government and/or commercial sources may be used as input.

Abstract: Techniques are disclosed for programmatically deriving street intersections from address data which is presented in textual format, or alternatively, from street geometry data which has been derived from such address data. Preferred embodiments leverage built-in functions and data types of a spatially-enabled object relational database system. Information about streets is analyzed to determine which streets intersect, as well as the intersection locations. This information is stored in a spatially-enabled table for subsequent retrieval. The derived street intersections data supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements. The derived street intersection information may be used in many ways, such as to compute a path from one location to another.

Abstract: A system for implementing a method for mapping a shelf is disclosed. The system comprises a relational database management system including spatial data types whereby the shelf is established as a geographical entity in terms of a location of the shelf within an isle, a location of the isle within a structure, and a duration of any product on the shelf. The system further comprises a spatial extender access module including user defined functions for accessing the geographical entity.