Abstract: Search engines today are capable of incorporating numeric scoring modifiers from controlling applications into their relevance computations. Challenges arise in keeping these modifiers current, given that they may change over time. Embodiments provide a new way to compute numeric value decay for efficient relevance computation without having to rely on a controlling application. The controlling application can set a value for a modifier of an object managed by the controlling application and the controlling application can perform operations on the modifier. However, the controlling application does not need to keep track of the modifier and compute the modifier value independently. Rather, a search engine is configured to perform decay computation(s) and adjust the modifier value on a regular basis or on demand. The search engine ensures that modifier values for all the objects indexed by the search engine are always valid—within acceptable ranges and with acceptable adjustments.

Abstract: Responsive to a request from a user device, a content server may perform an electronic discovery function. The request may include information on a quantity of data objects desired from a collection of data objects stored in a repository. Objects stored in the repository may be managed by the content server. The content server may determine a number of batches and process the collection of data objects into batches, each having a batch size. An efficient selection process may be determined and utilized in selecting data objects from each of the batches such that a total number of data objects selected from the collection is not less than the quantity of data objects desired. The content server may make a disk image of the selected data objects and communicate same to the user device over a network.

Abstract: A search engine may maintain a list of derived metadata. When an event occurs that requires updating a search index, the search engine can determine which metadata is derived metadata and take appropriate actions with respect to the derived metadata. For example, if a request is received to update the index for a particular object, the search engine may protect the derived metadata from change while updating the other metadata in the index. As another example, if a request is received to update the text content for the object, the search engine may change the text content and the derived metadata. By identifying derived metadata, the search engine can protect the derived metadata from change when a request is received that otherwise causes metadata to change and can change the derived metadata when a request is received that would otherwise not change the metadata portion of the index.

Abstract: A search engine may maintain a list of derived metadata. When an event occurs that requires updating a search index, the search engine can determine which metadata is derived metadata and take appropriate actions with respect to the derived metadata. For example, if a request is received to update the index for a particular object, the search engine may protect the derived metadata from change while updating the other metadata in the index. As another example, if a request is received to update the text content for the object, the search engine may change the text content and the derived metadata. By identifying derived metadata, the search engine can protect the derived metadata from change when a request is received that otherwise causes metadata to change and can change the derived metadata when a request is received that would otherwise not change the metadata portion of the index.

Abstract: A search system can maintain a search index of metadata and text for objects in a repository, repositories or distributed across a network. The search index can be divided into partitions with a partition assigned a first capacity utilization threshold and a second capacity utilization threshold. If the capacity utilization of the partition is below the first threshold, the system can add, update and delete information in the partition. If the capacity utilization of the partition is above the first threshold, the system can update and delete information in the partition, but cannot add information for new objects to the partition. If the capacity utilization of the partition is above the second threshold, the system can enter a rebalancing mode in which it seeks to rebalance capacity utilization between partitions. The behavior of the system can change depending upon the size of a partition relative to its configurable thresholds.

Abstract: Embodiments of document management systems that utilize replicas are disclosed. A core document management module of a document management system is configured to return a replica (if one exists) in response to a request for either a version of a document or a replica of the document. Thus, modifications that are done by a user or an automated add-in module may be performed on the replica. When a process stores the modified document it may store it as a replica. This modified replica will replace the existing replica of the version.

Abstract: Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified.

Abstract: Embodiments as disclosed may provide a search operator that addresses the problem of query construction for finding objects that include some number (N) of a set of terms (M). Moreover, embodiments as disclosed herein may efficiently implement the searches specified by such subset operators using a subset process that combines results from a set of term processes where only one term process may be needed for each search term (or search term variant).

Abstract: Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified.

Abstract: Responsive to a request from a user device, a content server may perform an electronic discovery function. The request may include information on a quantity of data objects desired from a collection of data objects stored in a repository. Objects stored in the repository may be managed by the content server. The content server may determine a number of batches and process the collection of data objects into batches, each having a batch size. An efficient selection process may be determined and utilized in selecting data objects from each of the batches such that a total number of data objects selected from the collection is not less than the quantity of data objects desired. The content server may make a disk image of the selected data objects and communicate same to the user device over a network.

Abstract: A system and method for curation of document versions with significantly reduced storage requirements. In some embodiments, all or substantially all versions of a document are at least initially retained. Based on various criteria, versions of the document are selectively deleted while preserving the versions that are likely to provide the highest value. Advantageously, the teachings of embodiments as described can be used in conjunction with various systems, including document versioning, deduplication, and retention systems.

Abstract: Systems, methods, and computer program products for enabling assessment of the quality of a search index. In one embodiment, objects are processed to produce corresponding text that is stored and indexed. The objects are also processed to identify and store corresponding metadata values for indexing. Error conditions that are detected during the processing of objects to generate corresponding text are tracked and compared to determine the most severe of the error conditions. An indication of the most severe error condition is stored in a first consolidated error field. Errors that are encountered in the identification and storage of metadata values are counted and this count is stored in a second consolidated error field. Both of the consolidated error fields are indexed in the same manner as the text and metadata for the objects, so that the stored error information can be used in queries of the search index.

Abstract: A search engine may maintain a list of derived metadata. When an event occurs that requires updating a search index, the search engine can determine which metadata is derived metadata and take appropriate actions with respect to the derived metadata. For example, if a request is received to update the index for a particular object, the search engine may protect the derived metadata from change while updating the other metadata in the index. As another example, if a request is received to update the text content for the object, the search engine may change the text content and the derived metadata. By identifying derived metadata, the search engine can protect the derived metadata from change when a request is received that otherwise causes metadata to change and can change the derived metadata when a request is received that would otherwise not change the metadata portion of the index.

Abstract: A search engine may maintain a list of derived metadata. When an event occurs that requires updating a search index, the search engine can determine which metadata is derived metadata and take appropriate actions with respect to the derived metadata. For example, if a request is received to update the index for a particular object, the search engine may protect the derived metadata from change while updating the other metadata in the index. As another example, if a request is received to update the text content for the object, the search engine may change the text content and the derived metadata. By identifying derived metadata, the search engine can protect the derived metadata from change when a request is received that otherwise causes metadata to change and can change the derived metadata when a request is received that would otherwise not change the metadata portion of the index.

Abstract: Systems, methods, and computer program products for enabling assessment of the quality of a search index. In one embodiment, objects are processed to produce corresponding text that is stored and indexed. The objects are also processed to identify and store corresponding metadata values for indexing. Error conditions that are detected during the processing of objects to generate corresponding text are tracked and compared to determine the most severe of the error conditions. An indication of the most severe error condition is stored in a first consolidated error field. Errors that are encountered in the identification and storage of metadata values are counted and this count is stored in a second consolidated error field. Both of the consolidated error fields are indexed in the same manner as the text and metadata for the objects, so that the stored error information can be used in queries of the search index.

Abstract: Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified.

Abstract: Systems, methods, and computer program products for enabling assessment of the quality of a search index. In one embodiment, objects are processed to produce corresponding text that is stored and indexed. The objects are also processed to identify and store corresponding metadata values for indexing. Error conditions that are detected during the processing of objects to generate corresponding text are tracked and compared to determine the most severe of the error conditions. An indication of the most severe error condition is stored in a first consolidated error field. Errors that are encountered in the identification and storage of metadata values are counted and this count is stored in a second consolidated error field. Both of the consolidated error fields are indexed in the same manner as the text and metadata for the objects, so that the stored error information can be used in queries of the search index.

Abstract: A search system can maintain a search index of metadata and text for objects in a repository, repositories or distributed across a network. The search index can be divided into partitions with a partition assigned a first capacity utilization threshold and a second capacity utilization threshold. If the capacity utilization of the partition is below the first threshold, the system can add, update and delete information in the partition. If the capacity utilization of the partition is above the first threshold, the system can update and delete information in the partition, but cannot add information for new objects to the partition. If the capacity utilization of the partition is above the second threshold, the system can enter a rebalancing mode in which it seeks to rebalance capacity utilization between partitions. The behavior of the system can change depending upon the size of a partition relative to its configurable thresholds.

Abstract: A search system can maintain a search index of metadata and text for objects in a repository, repositories or distributed across a network. The search index can be divided into partitions with a partition assigned a first capacity utilization threshold and a second capacity utilization threshold. If the capacity utilization of the partition is below the first threshold, the system can add, update and delete information in the partition. If the capacity utilization of the partition is above the first threshold, the system can update and delete information in the partition, but cannot add information for new objects to the partition. If the capacity utilization of the partition is above the second threshold, the system can enter a rebalancing mode in which it seeks to rebalance capacity utilization between partitions. The behavior of the system can change depending upon the size of a partition relative to its configurable thresholds.

Abstract: Search engines today are capable of incorporating numeric scoring modifiers from controlling applications into their relevance computations. Challenges arise in keeping these modifiers current, given that they may change over time. Embodiments provide a new way to compute numeric value decay for efficient relevance computation without having to rely on a controlling application. The controlling application can set a value for a modifier of an object managed by the controlling application and the controlling application can perform operations on the modifier. However, the controlling application does not need to keep track of the modifier and compute the modifier value independently. Rather, a search engine is configured to perform decay computation(s) and adjust the modifier value on a regular basis or on demand. The search engine ensures that modifier values for all the objects indexed by the search engine are always valid—within acceptable ranges and with acceptable adjustments.