Abstract: Data is identified from one or more data sources, where the data is associated with at least one structured document. Data sets contained within the at least one structured document are extracted, and one or more record items are added to a searchable database, where the one or more record items correspond to the extracted data sets.

Abstract: A method for assigning relative quality scores to a collection of linked documents is presented. The method includes constructing a spring network according to a connectivity graph of a linked database and determining the strength of inter-nodal springs based on the link structure of the network and the displacements on end-nodes. The method may further include computing the displacements of the nodes in a spring network through an iterative process and obtaining the quality scores for documents from the converged displacements of nodes. The method may also include obtaining the relative quality scores for groups of documents. The method may further include assigning topic-specific quality scores to documents in a linked database.

Abstract: Methods and systems for extraction and summarization of sentiment information related to a particular research subject are disclosed. A method includes accessing sources of information that contain sentiment information that is related to the research subject and extracting the sentiment information from the sources of information as opinions related to the research subject. Opinion categories related to features of the research subject are identified. From this information a summarization of the sentiment information that is related to the particular research subject that includes the identified opinion categories is generated. Subsequently, access is provided to the summarization for graphical presentation.

Abstract: A file system transfer designation section for transferring the file system matching with file system transfer rules from the first volume of the first storage apparatus to the second volume of the second storage apparatus based on the first file system transfer rules, a file system storage information manager for updating storage information of the file system in accordance with transfer of the file system by the file system transfer designation section, and transmitting the updated file system storage information, and a search information manager for updating search information for searching the files based on a file search request from the client apparatus using the file system storage information sent by the file system storage information manager are provided.

Abstract: A system and method are described for efficiently filtering and restoring tables within an enterprise application server. For example, one embodiment of the invention detects that a filtering function has been selected for a particular table node and responsively stores elements from the table node within a backup table collection. The filtering function is then performed to generate a filtered table node containing a subset of elements specified by the filtering function. Subsequently, upon detecting that the filtering function has been disabled, the table node may be restored from the backup table collection.

Abstract: In response to characters entered within a Find dialog box, a minifind window is dynamically updated to provide corresponding search strategies and quick matches from content search data that are being searched. The search strategies and quick matches that are listed are dynamically updated as the user inputs additional characters in the Find dialog box. At any time, the user can initiate a full text search to populate a search results pane, based upon the characters input, by selecting a Go control or pressing the Enter key. Alternatively, the user can select one of the quick matches or search strategies, to populate the search results pane with corresponding items obtained from the content search data, which are most likely to relate to the information desired by the user. This approach is applicable to finding information in almost any data accessed locally, or over a network.

Abstract: A digital forensic search tool which enables a first entity, such as a federal investigation agency, to share its suspect and sensitive data with a second entity, such as another investigative agency, in a manner that allows the second agency to utilize the suspect data while not revealing the actual content of the sensitive data to the second agency. The second agency can perform comparisons and other operations on the sensitive data without having to know the actual content of the data. The search tool allows an investigative agency to define an investigative strategy for a particular case via the search markup language programs and by the data features that it includes in the search tool. Thus, by sharing search tools among agencies, an agency can share or inform others of that agency's theory of the case and investigative goal.

Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.

Abstract: A method is provided enabling concurrent garbage collection of a young generation of a task with other tasks executing in a multi-tasking virtual machine. A first record is provided for each thread which has a value in an old generation memory after each thread successfully allocates an object in the old generation memory. A second record is provided for each thread which has a memory address value. Threads of a garbage-collecting task are stopped and an end of scan value for the task is calculated. Garbage collection on threads associated the garbage-collected task are permitted when one of two conditions involving either second records or second records and first records are met.

Abstract: Information representing a plurality of clients on a network is stored in a data structure. The data structure may be stored within a server or agent in a content delivery network and may include client network address information. The data structure is dynamically compressed based on network proximity information relating to the clients.

Abstract: A computer implemented method, apparatus, and computer usable program code for detecting monotonicity. A determination is made as to whether a function that is assumed to be monotonic will remain monotonic after performing an operation in response to receiving the operation. The operation is allowed to be performed in response to a determination that the function will remain monotonic after performing the operation.

Abstract: The present invention extends to methods, systems, computer program products, and data structures for managing database snapshot storage. Spatial properties database transactions are used to manage database snapshot storage allocation and reclamation. When a read transaction and subsequent write transactions refer to disjoint portions of a database, the read transaction can continue to read portions of data directly from the database. When a read transaction and subsequent write transactions refer to intersecting portions of a database, the read transaction can be transitioned to “snapshot” mode. The write transaction can publish a database snapshot can configure the read transaction to read contested portions of data from the published snapshot.

Abstract: A method, system and article of manufacture for migration of databases and, more particularly, for optimizing migration of a database from a source system to a target system. One embodiment provides a computer-implemented method for optimizing migration of a database from a source system to a target system. The method comprises collecting source parameters related to performance characteristics for the database on the source system. On the basis of the collected source parameters and target parameters of the target system database configuration information is generated. The target parameters will affect the operation of the database on the target system as compared to the operation of the database on the source system. The database configuration information is applicable to tune the database to operate on the target system. The method further comprises configuring the database to run on the target system according to the database configuration information.

Abstract: A method to process database queries are disclosed. One embodiment comprises receiving an abstract query against a database having a multiplicity of data records. The abstract query identifies a model entity that defines a focus of the abstract query. The method further comprises receiving a limitation request configured to restrict a result set for the abstract query. The limitation request specifies a limitation on data records that are returned for one or more instances of the underlying model entity. From the abstract query, an executable query capable of being executed by a query engine is generated. The executable query is modified on the basis of the limitation request. The modified executable query is executed against the database to obtain the result set, whereby the result set is restricted as requested by the limitation request.

Abstract: Records in a secure database include attributes. A query homomorphically encrypts indices identifying one record and attribute. A secret key is generated at a certain query count and is divided into randomly generated key shares. A key share sequence is homomorphically encrypted. A table is formed by encrypting the indices, secret key and attributes. The key shares are decrypted sufficient to recover the secret key subject to a non-inference enabling query. In a further embodiment, a query count is maintained. Records in a secure database include attributes, with an attributes set forming inference channels. A data structure includes ciphertext keys. A pseudorandom function seed and non-malleable encryption secret key are chosen. A query provides indices identifying one record and attribute. A secure function evaluation is executed. A table combines the attributes with the pseudorandom function applied to the seed and indices. A table entry for the indices is provided.

Abstract: A method is disclosed for reorganizing a set of database partitions based on a ranked set of database partitions. The method includes a step to determine a fragmentation indicator for each database partition within a set of database partitions. A step ranks the set of database partitions according to a rank criteria. The rank criteria includes, at a minimum, the fragmentation indicator. A step reorganizes a subset of the database partitions in the ranked set of database partitions. The subset is selected, at least in part, by a rank order for the ranked set of database partitions. The subset may be selected such that ranked database partitions satisfying a reorganization threshold are included in the subset.

Abstract: A method for detecting granular data store changes in a computing environment. Data values stored in a first relational database are changed. Each data value is stored in a row and a column of the first relational database. Rows (i.e., changed rows) including the changed data values are identified. Changed rows are propagated to a second relational database. Columns including the changed data values are identified in the second relational database. The types of changes associated with the changed data values are identified. Filters optionally filter out one or more of the changed data values from further processing. At least one data value of the changed data values, along with their types of changes, are transformed into a language neutral format included in packaged data to be sent in response to a client requesting the at least one data value.