Abstract: A computer implemented method, apparatus, and computer usable program code for collecting data. The data is collected from a particular data source by an application portion of agent to form collected data. The application portion is associated with the particular data source in response to an event. The collected data stored in a temporary data store for transfer to a data storage system to form stored data. The stored data sent to the data storage system using a generic portion of the agent, wherein the generic portion of the agent is configured to send data to the data storage system.

Abstract: A computer implemented method for accessing data begins with receipt of a data access request. In response to determining that the requested data needs to be acquired in real time from an original data source, the processor acquires and stores that data. In response to determining that the data cannot be acquired in real time from the data source, the processor acquires the data from a configuration management database in which the requested data was previously stored.

Abstract: A work performance acquisition module of an intelligent assets maintenance system obtains work performance data of intelligent assets from a device operation production control system. A status monitoring module obtains operation status data of the intelligent assets. A loss calculation module calculates a loss degree of the intelligent assets according to the obtained work performance and operation status data. A maintenance determining module determines whether the intelligent assets need maintenance according to the loss degree of the intelligent assets.

Abstract: A computer implemented method, apparatus, and computer usable program code to identify a policy for managing data in a data storage system. Raw data is located in the data storage system for processing to form located data. The located data is aggregated based on the policy to form aggregated data. The aggregated data is stored in the data storage system.

Abstract: A work performance acquisition module of an intelligent assets maintenance system obtains work performance data of intelligent assets from a device operation production control system. A status monitoring module obtains operation status data of the intelligent assets. A loss calculation module calculates a loss degree of the intelligent assets according to the obtained work performance and operation status data. A maintenance determining module determines whether the intelligent assets need maintenance according to the loss degree of the intelligent assets.

Abstract: A computer implemented method for accessing data begins with receipt of a data access request. In response to determining that the requested data needs to be acquired in real time from an original data source, the processor acquires and stores that data. In response to determining that the data cannot be acquired in real time from the data source, the processor acquires the data from a configuration management database in which the requested data was previously stored.

Abstract: A computer implemented method, apparatus, and computer usable program code to aggregate data. Data is parsed for a behavior tag assigned to a portion of the data. In response to detecting a behavior tag, a determination is made as to whether a policy is associated with the behavior tag. The policy associated with a behavior tag defines how the portion of the data assigned to the behavior tag is to be aggregated. The portion of the data is aggregated using the policy associated with the behavior tag.

Abstract: A system for automatic presence and ambient noise detection for a client device. An incoming message from a caller is received and in response to receiving the incoming message from the caller, a client device state is detected based on a callee situation as dynamically detected by using the client device. After detecting the client device state, the incoming message is converted according to a rule set. The converted incoming message is then rendered on the client device differently than the incoming message would have been by the client device.

Abstract: A computer implemented method, apparatus, and computer usable program code for managing data in a data storage system. A section of data in the data storage system is identified. The section of data in the data storage system is pruned based on a policy.

Abstract: A computer implemented method, apparatus, and computer usable program code for collecting data. The data is collected from a particular data source by an application portion of agent to form collected data. The application portion is associated with the particular data source in response to an event. The collected data stored in a temporary data store for transfer to a data storage system to form stored data. The stored data sent to the data storage system using a generic portion of the agent, wherein the generic portion of the agent is configured to send data to the data storage system.

Abstract: A computer implemented method, apparatus, and computer usable program code to aggregate data. Data is parsed for a behavior tag assigned to a portion of the data. In response to detecting a behavior tag, a determination is made as to whether a policy is associated with the behavior tag. The policy associated with a behavior tag defines how the portion of the data assigned to the behavior tag is to be aggregated. The portion of the data is aggregated using the policy associated with the behavior tag.

Abstract: A computer implemented method, apparatus, and computer usable program code to identify a policy for managing data in a data storage system. Raw data is located in the data storage system for processing to form located data. The located data is aggregated based on the policy to form aggregated data. The aggregated data is stored in the data storage system.

Abstract: A database schema for storing application data in a relational database backing store of a directory service. The application data has at least some entries with multiple value attributes. According to the invention, the application data is profiled to determine how it may be optimally stored in the backing store. Preferably, single entries having single value attributes are stored in a merged attribute table, while entries having multiple value attributes are stored in per attribute tables. According to the optimization, a majority of the attributes are single valued and are stored in the merged table, and the per attribute tables thus store a relatively smaller number of exceptions. This database schema enhances processing of conventional directory service queries into the backing store.

Abstract: A method for securing and processing sparse access control list (ACL) data in a relational database used as a backing store for a hierarchical-based directory service. The sparse ACL data is secured in a plurality of tables. An owner table stores data objects with explicitly set ACLs. A propagation table stores data on whether individual ACLs are inherited by descendant objects. A permissions table stores data regarding permissions which a user may perform on an object. A source table stores data for a set of ancestor objects having respective ACLs for each of a set of descendant objects. Preferably, the tables are stored in the relational database together with the objects. For a given object, data in the tables is used to determine the given object's entry owner and ACL. The inventive technique has particular applicability in a Lightweight Directory Access Protocol (LDAP) directory service having a relational database as a backing store.

Abstract: A method of enabling an HTTP server plug-in to pass an unmangled environment variable into a CGI process begins by configuring the HTTP server to initially override a CGI service method. When the server processes an HTTP request, the server plug-in, which is called prior to the CGI service method and is running in a process of the HTTP server, inserts a “name value” pair prepended with a marker in a request header parameter block of the HTTP server. Then, the CGI service override method executes the server's original (i.e. native) CGI service method, causing it to run an encapsulation program in the CGI process. This program scans the environment of the CGI process for any string prepended with a given HTTP code (e.g., the string “HTTP_”) and the marker. If it finds any such string, the program strips the given HTTP code and the marker from a remainder of the string and resets the environment variable into the CGI process in an “unmangled” form.

Abstract: A method for securing sparse access control list (ACL) data in a relational database used as a backing store for a hierarchical-based directory service. The sparse ACL data is secured in a plurality of tables. An owner table stores data objects with explicitly set ACLs. A propagation table stores data on whether individual ACLs are inherited by descendant objects. A permissions table stores data regarding permissions which a user may perform on an object. A source table stores data for a set of ancestor objects having respective ACLs for each of a set of descendant objects. Preferably, the tables are stored in the relational database together with the objects. For a given object, data in the tables is used to determine the given object's entry owner and ACL. The inventive technique has particular applicability in a Lightweight Directory Access Protocol (LDAP) directory service having a relational database as a backing store.

Abstract: A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. The method begins by parsing an LDAP filter-based query for elements and logical operators of the filter query. For each filter element, the method generates an SQL subquery according to a set of translation rules. For each SQL subquery, the method then generates a set of entry identifiers for the LDAP filter query. Then, the SQL subqueries are combined into a single SQL query according to a set of combination rules chosen corresponding to the logical operators of the LDAP filter query.

Abstract: A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. The method begins in response to a search query to the relational database. Search results retrieved in response to the search query are cached, preferably in a pair of caches in the directory service. The first cache receives a set of identifiers indexed by a filter key of the search query. The search results, namely entries corresponding to the set of identifiers, are then stored in the second cache. In response to subsequent issuance of the search query, the cached search results are then used in lieu of accessing the relational database to increase search efficiency. To maintain the integrity of the cached information, routines are provided to invalidate the caches during given directory service operations.

Abstract: A method of hierarchical LDAP wildcard searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. The relational database normally includes a forward index of the character strings in the database. The method begins by generating a reverse index of the character strings in the relational database. Depending on the position of one or more wildcards in the string, the forward index, the reverse index, or both indices, are used to generate the relational database query.

Abstract: A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. According to the invention, entries in a naming hierarchy are mapped into first and second relational tables: a parent table, and a descendant table. These tables are used to "filter" lists of entries returned from a search to ensure that only entries within a given search scope are retained for evaluation. Thus, for example, the parent table is used during an LDAP one level search, and the descendant table is used during an LDAP subtree search. In either case, use of the parent or descendant table obviates recursive queries through the naming directory.