Abstract: Systems, methods, and other embodiments associated with selectively acquiring and utilizing query statistics are described. One example method includes selectively acquiring statistics associated with search queries submitted to a search process during a sample period. The statistics may be associated with an index and tokens associated with the index and search queries. The method may also include selecting tokens and/or queries to optimize based, at least in part, on the statistics. In one example, whether and/or how the tokens and/or queries are optimized may depend on estimating index fragmentation based, at least in part, on the statistics.

Abstract: Activity data is analyzed or evaluated to detect behavioral patterns and anomalies. When a particular pattern or anomaly is detected, a system may send a notification or perform a particular task. This activity data may be collected in an information management system, which may be policy based. Notification may be by way e-mail, report, pop-up message, or system message. Some tasks to perform upon detection may include implementing a policy in the information management system, disallowing a user from connecting to the system, and restricting a user from being allowed to perform certain actions. To detect a pattern, activity data may be compared to a previously defined or generated activity profile.

Abstract: A method of performing an analysis on internal hard drive(s), which includes an analysis of the file management system, individual files that exist on the hard drive, developing a Unique ID for each program (i.e., executable) file and continuously analyzing (i.e., scanning) the hard drive(s) to detect physical changes in the previously analyzed program files. The method may be implemented on a computer unit, which can be a 32/64-bit Microsoft PC O/S, or a 32/64-bit Microsoft Server O/S.

Abstract: A method, apparatus or software are disclosed for verifying a parameter value against a predetermined threshold function in which a sequence of reference values is retrieved, each reference value being associated with a respective sampling point N, said reference values representing a threshold function at said respective sampling points N; a profile type is associated with said threshold function, said profile type being arranged, when combined with said sequence of reference values, to provide an approximation to said threshold function for a region of said threshold function between said reference values; a parameter value is received for verification against said threshold function, said parameter value being associated with a discrete time P; said sequence of reference values is combined with said profile type to provide an approximation of said threshold function; and said parameter value is verified against said approximation of said threshold function.

Abstract: The invention provides a method, system, and program product for optimizing a data library. A first aspect of the invention provides a method of optimizing a data library, comprising: moving a plurality of data files from a plurality of data library volumes to a staging area; sorting the data files into a plurality of directories based on at least one criterion of the data files; transferring data files from a first directory to a transfer medium; deleting the first directory; transferring data files from a second directory to a transfer medium; and deleting the second directory.

Abstract: An information apparatus searches content that is stored in a database by using a search engine based on a newly input keyword; acquires a search operation history of the content that is acquired by the search engine via an operation history engine; and updates the keyword associated with the content that is registered in the database by collating the search operation history and the newly input keyword. While adding of the inappropriate search information (keyword) is prevented, the appropriate search information can be automatically updated and set to the content.

Abstract: Disclosed are methods and apparatus for segmenting and labeling a collection of token sequences. A plurality of segments of one or more tokens in a token sequence collection are partially labeled with labels from a set of target labels using high precision domain-specific labelers so as to generate a partially labeled sequence collection having a plurality of labeled segments and a plurality of unlabeled segments. Any label conflicts in the partially labeled sequence collection are resolved. One or more of the labeled segments of the partially labeled sequence collection are expanded so as to cover one or more additional tokens of the partially labeled sequence collection. A statistical model, for labeling segments using local token and segment features of the sequence collection, is trained based on the partially labeled sequence collection. This trained model is then used to label the unlabeled segments and the labeled segments of the sequence collection so as to generate a labeled sequence collection.

Abstract: A method and a system of detecting a keyword whose input number is rapidly increased in real time which can estimate a search number at a future point in time by reflecting an input trend of the keyword in real time at a present point in time and can immediately detect the keyword whose input number is rapidly increased according to a criterion value calculated by the estimated search number. Specifically, the method and system of detecting a keyword whose input number is rapidly increased in real time which can estimate the search number for each keyword at the future point in time in real time and can immediately detect the keyword whose input number is rapidly increased according to a criterion value calculated by the estimated search number.

Abstract: Systems and methods for automating and increasing the efficiency of access to data using inheritance of access rules within an organization based upon the relationship of positions within the organization and the roles associated with the positions. In one embodiment, a role structure is used in conjunction with a hierarchical organization structure to allow access rules to be inherited by some of the positions from other positions based upon the relationship of positions within the organization and the roles associated with the positions. Access rules can be applied across equivalent or similar positions, yet differentiated between distinct portions of the organization and the distinct roles associated with the positions. Consequently, particular access rules are not necessarily inherited by all of the positions subordinate to a particular position with which the rule originates, and are not necessarily inherited by all of the positions that are associated with a particular role.

Abstract: A method of, a computer program product for and a computer system for managing statistics in a database management system are provided. A value of a volatility of a statistic is determined. A value of a staleness of the statistic is determined using the value of the volatility. A statistics collection task is generated in response to, at least in part, the value of the staleness exceeding a value of a staleness threshold. The statistics collection task is executed to collect an additional value of the statistic. The additional value of the statistic is stored.

Abstract: Analyzing performance data from a relational database to discover poorly performing SQL statements includes creating event records of performance data for query statements executed by a relational database management system, and condensing the performance data in the event records. A performance summary can be generated for each condensed event record. The performance summaries can then be analyzed based on performance characteristics to identify poorly performing SQL statements.

Abstract: Auto-tuning can be performed by receiving a database query language statement and performance information related to the statement, determining whether one or more performance statistics of the statement are available or missing in the performance information, and determining an auto-tuning hint for each missing statistic.

Abstract: A system of and method for maintaining data objects in containers across a network of distributed heterogeneous resources in a manner which is transparent to a client. A client request pertaining to containers is resolved by querying meta data for the container, processing the request through one or more copies of the container maintained on the system, updating the meta data for the container to reflect any changes made to the container as a result processing the request, and, if a copy of the container has changed, changing the status of the copy to indicate dirty status or synchronizing the copy to one or more other copies that may be present on the system.

Abstract: The present invention relates to a method and system for using an external program to generate and update statistical information used by a database optimizer for at least one of a database and a database management system, at least one table of data being replicated from the database to the external program, the external program generating statistical information on the replicated data and sending the generated statistical information back to the database for use with the optimizer. The replicated data residing with the external program may also be used by an application for the execution of database queries instead of the database itself with the application using a list of replicated tables or replicated data to determine where to target its queries.

Abstract: The present solution addresses the need to carry out reorganization of a database storage. A statistics-based reorganization check procedure is performed on at least first database tables and indexes, resulting in a preliminary reorganization recommendation. Information on workload on tables and indexes of said database storage is received. Based on the information on workload and the preliminary reorganization recommendation, it is decided whether to carry out reorganization of the database storage in accordance with the preliminary reorganization recommendation.

Abstract: Data files are action tagged by electronic devices as the files are used, and such tags are used to compute a total value for each data file among a group of data files for the purpose of running comparative-type operations, e.g., sorting or organizing the group of data files, or searching for one or more files in the group. The action tags are carried on each data file, preferably in the header, so as to travel with the file as the file is transferred among devices. The action tagging generally involves tracking, and storing as metadata in the data file, each occurrence of each of multiple indirect actions, and one or more characteristics associated with each indirect action occurrence. In setting up a comparative-type operation, a user can select via an interface one or more parameters with which to constrain each input value computation for respective indirect activities. A user-selected weight can be assigned to each input calculation.

Abstract: A self-managing workload repository (AWR) infrastructure useful for a database server to collect and manage selected sets of important system performance statistics. Based on a schedule, the AWR runs automatically to collect data about the operation of the database system, and stores the data that it captures into the database. The AWR is advantageously designed to be lightweight and to self manage its use of storage space so as to avoid ending up with a repository of performance data that is larger than the database that it is capturing data about. The AWR is configured to automatically capture snapshots of statistics data on a periodic basis as well as purge stale data on a periodic basis. Both the frequency of the statistics data capture and length of time for which data is kept is adjustable. Manual snapshots and purging may also be performed. The AWR captured data allows for both system level and user level analysis to be automatically performed without unduly impacting system performance, e.g.

Abstract: Particular embodiments generally relate to displaying database time using a treemap. A set of database time values is determined for a set of dimensions. The database time values measure performance of one or more databases by the time the database takes to respond to a request. The set of database time values is correlated to a set of cells in the treemap. A size of the cell is determined based on the database time value associated with it. For example, the database time value is correlated to an area of the cell. A layout of the set of cells is determined and the treemap is displayed using the layout. For example, the largest values of database time may be shown with the largest sized cells. This makes it easier for an administrator to review and analyze the database performance across multiple dimensions and determine problem areas affecting the performance of the one or more databases.

Abstract: A method for metadata verification of a data repository of a computer system is described comprising accessing a data repository through a data profiler program, querying the data repository for metadata information about the data repository, presenting statistics regarding the metadata information using the profiler, analyzing the metadata information to identify suspect metadata information from the data repository and presenting the suspect metadata information for inspection using the profiler.

Abstract: Database performance and availability monitoring of changes impacting database performance, availability and continuity to the underlying business may be performed. A method for doing so may include analytical and visual real-time analysis engines to identify and provide alert notifications on changes in database performance statistics (such as CPU consumption, physical I/O, etc.) related to a sample period of time on a single database or across multiple databases. Result data may be displayed through a series of charts and/or summary tables that may indicate whether correlations exist between unexpected database performance and relative changes in database performance statistical parameters.

Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.

Abstract: A method and a system to organize a data set into groups of data subsets in multiple passes using different parameters and to automatically name the groups is disclosed. For example, a data set is retrieved in accordance with a search query submitted by a user. The data set is organized into clusters based on a statistic(s) of the data set. The data set is then organized into groups of data subsets based on an attribute(s) indicated by the data set. Each of the groups are automatically named based on a property shared by data units of the group. The name(s) of a group may be mined from the data units of the group, retrieved from a structure that maps to attribute values indicated by the data units of the group, etc.

Abstract: Database indexes include multiple fields that are used to track how the components of the index are used. An index component monitoring mechanism tracks how the components of the index are used, and updates fields in the index accordingly. Such component-level statistics allow a query optimizer to make more intelligent decisions regarding when to build a new index and when to discard an index, and also provide information regarding which queries are using the index, the maintenance cost of the index, and the selectivity of the index when used to process a query.

Abstract: A method for locating a resource involves maintaining a capacity object configured to store server information for a plurality of servers, transmitting a resource request from a client to an indirection server comprising the capacity object, selecting one of the plurality of servers to service the resource request using server associated with the capacity object to obtain a selected server, and redirecting the resource request from the indirection server to the selected server.

Abstract: An information processing apparatus for searching for a desired content from a storage unit storing a plurality of contents to which a plurality of attributes is set classifies stored contents by each of the attributes. The information processing apparatus then counts the number of registered contents classified by each of the attributes and determines an attribute as a criterion for classifying contents.

Abstract: Methods for detecting inter-module dependencies involve receiving by a software configuration control system check-in for each of a plurality of software components accompanied by check-in information consisting at least in part of defect information, which is utilized to identify coupling between any of the checked-in software components that were checked in together on a same defect and any of the checked-in software components that were checked in on a defect that was introduced by a defect in another software component. Warnings and reports are generated of a likely incidence of coupling between any of the software components identified as having been checked in together on a same defect, as well as between any of the software components identified as having been checked in on a defect that was introduced by a defect in another software component and such other software component.

Abstract: A probability distribution for a reference summary of a document is determined. The probability distribution for the reference summary is then used to generate a score for a machine-generated summary of the document.

Abstract: A data structure that includes at least one partition containing non-confidential quasi-identifier microdata and at least one other partition containing confidential microdata is formed. The partitioned confidential microdata is disguised by transforming the confidential microdata to conform to a target distribution. The disguised confidential microdata and the quasi-identifier microdata are combined to generate a disguised data structure. The disguised data structure is used to carry out statistical analysis and to respond to a statistical query is directed to the use of confidential microdata. In this manner, the privacy of the confidential microdata is preserved.

Abstract: A system and method for distributed database data and file access and retrieval, and managing assets of a company can include the steps of obtaining one or more data elements, storing each of the data elements, determining one or more factors related to a manner in which each of the data elements was obtained, associating a confidence index with each factor, and calculating a confidence index for each of the stored data elements, as well as a composite confidence index for the entire data store, based on the confidence index score for the individual data elements. The system and method can include calculating a confidence index for each of the stored data elements. The factors can include the date that the data elements were obtained. The factors can include from which of one or more sources the data elements were obtained.

Abstract: A management device connected to a file server providing a computer with file data stored in a storage subsystem, and collects information about access to the file data. In the management device, a log of access to the file data stored in the storage subsystem is collected as access data, and the access data for the same file data is grouped. With such a configuration, a large amount of information about access to the file data can be easily used, and the amount of information can be compressed.

Abstract: A file monitoring system tracks progress of data processing of a data file. Various applications and systems transmit status updates at one or more stages of processing to the file monitoring system. The file monitoring system monitors the status updates and generates reports displaying the status of the data file at the predetermined processing states. Reports include end to end status, files received and files delivered.

Abstract: Messages which are provided to an application are monitored. Similarities between the messages are determined based on a distance algorithm, in one approach, and messages which are similar are assigned to a common group. For example, the messages may be HTTP messages which include a URL, HTTP header parameters and/or HTTP post parameters. The messages are parsed to derive a string which is used in the distance calculations. Additionally, application runtime data such as response times is obtained and aggregated for the group. Further, a representative message can be determined for each group for comparison to subsequent messages. Results can be reported which include a group identifier, representative message, count and aggregated runtime data.

Abstract: A system for evaluating data points against cadastral regulations to include a plurality of software modules programmed into a computer system with software and hardware configured to store and update a cadastral rule database containing a plurality of rules for determining the validity of the cadastral data (10). The cadastral database obtained from a data source reference data that is indicative of a plurality of established reference data points wherein the received input data corresponds to a plurality of measured data points with steps to co-process the input data and the referenced data according to the plurality of cadastral rules to determine an indication for the plurality of data points (20).