Abstract: Provided are a migration apparatus and method for converting a database of a mainframe system into an appropriate database for an open system. The migration apparatus includes: a data extraction module connected with a database of the mainframe system and extracting data composed of Extended Binary Coded Decimal Interchange Code (EBCDIC) in binary format; a code conversion module converting the extracted EBCDIC data into American Standard Code for Information Interchange (ASCII) code, full-width characters being converted into half-width characters corresponding to ASCII code using a previously set full-width/half-width conversion table; and a data transfer module transferring the data converted into ASCII code to store it in a database previously built in the open system to correspond to the database of the mainframe system. The migration apparatus and method efficiently reuse a conventionally used database via the rehosting process of converting a mainframe system into an open system.

Abstract: Embodiments of the invention relate to an improved electronic discovery. More specifically, embodiments relate to managing the process for creating search term sets to be applied to electronic data sets associated with a case in an electronic discovery system. A search term management application is provided that allows for multiple users to work collaboratively to define the final search term set that is subsequently applied to the corpus of electronic data for the case. In addition, the application provides for tracking the overall search term creation process. In addition, embodiments provide for a search term hit count engine that is configured to determine search term hit counts for a portion of a corpus of data, such that the determined search term hit count may be predictive of the volume of data needed to review.

Abstract: A computer-implemented method can include receiving, in a system that maintains web notebooks for a plurality of user accounts, a request for a web document from a client computing device; determining whether a portion of the requested web document is included in a web notebook associated with one of the plurality of user accounts; and when it is determined that the portion is included in a web notebook associated with one of the plurality of user accounts, providing for display by the client computing device a highlighted version of the web document having a visual indicator that highlights the portion. Determining whether a portion of the requested web document is included in a web notebook associated with one of the plurality of user accounts can include determining whether the portion is included in at least a threshold number of web notebooks associated with distinct user accounts.

Abstract: Techniques for predicting user interests based on information known about a specific context is provided. A context-independent relevance function is generated from information gathered from many users and/or from many documents (or files). Information about a specific context (e.g., a particular user, a particular group of users, or type of content) is used to adapt the CI relevance function to the specific context. Based on a query submitted by a user, the adapted relevance function is used to identify results that the user would most likely be interested in. Results may include references to webpages and advertisements.

Abstract: There is provided a method for searching a database to obtain data. The method includes (a) prioritizing a set of keys that are derived from a match inquiry, thus yielding a prioritized set of keys, wherein the prioritizing is based on, for each key of the set, an efficacy of using the key, (b) determining a subset of the prioritized set, and (c) retrieving, using the subset, a set of candidates for satisfying the match inquiry.

Abstract: A system, method and computer program product for presenting Uniform Resource Locator (URL) search results in response to a user query. The method includes receiving inputs from a plurality of users, each input from a respective user representing a path traversal of web pages identified by that user as having a relevance as determined by that user from a list of search result URLs generated by a search engine in response to a query. The system generates, from the received user inputs, a traversal result comprising a super directed graph, or a sub-directed graph constructed from the super directed graph, of web page nodes representing the URLs interconnected by edges, the super directed graph configured to include those URLs based on a popularity measure of the pages traversed; and the traversal result is displayed to include the URLs for user selection, in response to a subsequent user query.

Abstract: The present invention discloses a docbase management system and a method for extending docbase management system functions. The method includes: determining an extended function module which matches extended data, wherein, the extended function module is compatible with a system extension interface in a docbase management system; invoking, through the system extension interface of the docbase management system, the determined extended function module to process the extended data. The method provided by the present invention enables the docbase management system functions to be extended without recompiling the docbase management system.

Abstract: A system, method, and computer readable medium for preserving information in time variant data schemas are disclosed. The method includes determining if at least one modification request associated with a database schema has been received. In response to the modification request being received, a metadata table associated with the database schema is updated to include at least one entry associated with the modification request. The entry identifies an instance in time when an action associated with the modification request was performed.

Abstract: Distribution of content between publishers and consumers is accomplished using an overlay network that may make use of XML language to facilitate content identification. The overlay network includes a plurality of routers that may be in communication with each other and the publishers and consumers on the Internet. Content and queries are identified by content descriptors that are routed from the originator to a nearest router in the overlay network. The nearest router, for each unique content descriptor, generates a hash identification of the content descriptor which is used by remaining routers in the overlay network to provide the appropriate functions with respect to the content descriptor. In particular, this allows all routers in the overlay network except the nearest router to properly route content without processing every content descriptor.

Abstract: A method and system can be used to read and obtain data from messaging files regardless of the messaging environment used to generate the messaging files. The method and system can read part of a messaging file to identify the type of entry (e.g., email message, calendar item, address book entry, etc.) and access information on where information within the entry is located within the messaging file based on an identifying signature. The method and system can be used to obtain data from messaging files without having to recreate the messaging environment, including individual email accounts. The data can be stored in a target storage medium in a format that is more usable and more easily searched.

Abstract: A search based on one or more search terms is performed, and a subset of the returned search results is displayed. It is determined that a user has altered the position of an object located in multidimensional space. A first dimension of the multi-dimensional space corresponds to a variation in degree of a first filter criterion, and a second dimension corresponds to a variation in degree of a second filter criterion. The first and second filter criterion are different from the search terms and are not determined based on the search results. A value corresponding to each of the filter criteria is identified based on the position of the object in the first and second dimension, respectively. The search results are filtered based on each value to generate a second subset of the search results.

Abstract: A computer-readable, non-transitory medium stores therein a search program that causes a computer having access to a data block set that includes data groups respectively registered in data blocks, and a Bloom filter row of n Bloom filters that each have m bits indicating negativity in a given number of the data blocks, to execute a process that includes receiving a transposition request for the Bloom filter row; transposing the Bloom filter row into a transposed Bloom filter row of m transposed Bloom filters respectively of n bits gathered from the Bloom filters according to arrangement position in the Bloom filters; and storing the transposed Bloom filter row to a storage device, if a transposition request has been received at the receiving.

Abstract: A method and system for automatically assembling a complete machine readable description of a process by observing and filtering digital messages executing on one or more message bus and that relate to the process. Message details are stored and a tracker record published in a common format. The stored message details are processed into a set of service execution path descriptions, which in turn are processed into the complete machine readable description of the process, using a suitable process design language. The invention automates the capture and documentation of a process, regardless of the complexities of the underlying messaging environment, and produces a complete and unambiguous description of the end-to-end process, free of errors, omissions and interpretation, thereby addressing a key need in any process re-engineering project, including the delivery of SOA implementations and other forms of agile and adaptable systems.

Abstract: A business process catalog is built using pattern analysis of historical data of a database and deploying the built business process catalog to perform database recovery, A first set of statements are logged for transactions of a first business process batch and compared with a second set of statements. The second set of statements is included in a second business batch process stored in the business process catalog. The business process catalog is updated based on the comparison of the first and second sets of statements. The built business process catalog is deployed to identify and present business process batches to a database system user to select a business process batch used to perform the database system recovery.

Abstract: Expert domains for a query category represent domains from which a high percentage of search results for queries associated with the query category are retrieved. The expert domains are identified by establishing a base statistical model that indicates frequencies of appearance for domains in search results retrieved for queries corresponding to multiple categories. In addition, frequencies of domain appearance are determined for search results retrieved for queries associated with a category. Domains that appear more frequently in the search results corresponding to the category are identified as expert domains for the category. A user may be allowed to customize expert domains related to one or more categories by adding or removing expert domains for the category.

Abstract: A query generator is operable to generate a query for retrieving data that satisfy a conditional expression from a database, and/or perform an arbitrary calculation on at least part of the retrieved data. The query generator can receive an input query and analyze the query to ascertain whether it contains a replaceable token. If the query contains a replaceable token, the query generator can replace that token with user input specifying a parameter of the conditional expression and/or the arbitrary calculation, thereby generating an output query for retrieving the data that satisfy the conditional expression and/or performing the arbitrary calculation on the retrieved data.

Abstract: A method and mobile device are presented for centrally controlling backup functionality, so that parties such as backup devices will efficiently be informed how data content should be backed up from or restored to the mobile device. The mobile device exposes to a party rules for backing up or restoring data content, and those rules are not just for the party, but also are for other parties including the mobile device itself. The rules are contained in a list formatted in extensible markup language (XML). If the party is an external party, the mobile device provides an object exchange protocol (OBEX) capability object in response to the party fetching that object. The OBEX capability object describes capabilities of the mobile device, and is for use by the external party in order to access the list of rules via the mobile device exposing those rules to the external party.

Abstract: A system identifies a set of documents from a corpus of documents that are relevant to a word, phrase or sentence and that were published at approximately a same time period, where each document of the set of documents includes news content and has an associated headline. The system extracts headlines from the set of documents and derives a score for each headline of the extracted headlines based on how many times selected words in each headline occurs among all of the extracted headlines.

Abstract: Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.

Abstract: Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.