Abstract: A computer implemented method for safeguarding files, comprising the steps of designating a location on a first computer for storage of files to be safeguarded, selecting certain of the files to be safeguarded from the location based upon predetermined selection criteria, copying the selected files to be safeguarded to a second computer, deleting the selected files from the first computer, processing the selected files to be safeguarded on the second computer, and storing the selected files to be safeguarded in a restricted access database. In a second embodiment, the file is copied to a second computer, but not deleted from the first computer, in addition to all other steps of the method. The invention also includes an apparatus for carrying out the methods of the invention.
Abstract: A method for processing queries for a document of elements is provided. The document includes a plurality of subsections where each subsection includes at least a portion of elements in the document. The method comprises: receiving a query for a npath of elements in the document of elements; determining a plurality of step queries from the query, each step query including at least a part of the path of elements; for each step query in the plurality of step queries, determining one or more subsections that include elements that correspond to a step query; and determining at least one subsection that includes the path of elements of the query. A result for the query is generated using the at least one subsection.
Abstract: An objective of the present invention is to carry out setting efficiently both a database management system and a storage subsystem. In an information processing system having computers 1, 2 and the storage subsystem 3, the following processes are executed. A system definition program 5 in the computer 1 generates based on the database design information, database definition information defining a structure of plural tables constituting the database and storage location volume of data of the plural tables, and volume definition information defining a condition for determining a volume configuration. A volume definition program 6 in the storage subsystem 3 determines based on the volume definition information from the management server 1, a storage device configuring the volume out of plural storage devices 36a . . . 36p.
Abstract: The present invention provides for the efficient downloading of data set addresses from among a plurality of host computers, using a plurality of web crawlers. Each web crawler identifies URL's in data sets downloaded by that web crawler, and identifies the host computer identifier within each such URL. The host computer identifier for each URL is mapped to the web crawler identifier of one of the web crawlers. If the URL is mapped to the web crawler identifier of a different web crawler, the URL is sent to that web crawler for processing, and otherwise the URL is processed by the web crawler that identified the URL. Each web crawler sends URL's to the other web crawlers for processing, and each web crawler receives URL's from the other web crawlers for processing. In a preferred embodiment, each web crawler processes only the URL's assigned to it, which are the URL's whose host identifier is mapped to the web crawler identifier for that web crawler.
Type:
Grant
Filed:
November 3, 2000
Date of Patent:
November 21, 2006
Assignee:
Hewlett-Packard Development Company, L.P.
Abstract: An object oriented query such as an enterprise java bean query is translated into a corresponding relational query by identifying an inter-hierarchal relationship relating two or more object oriented hierarchies; identifying a source object oriented hierarchy of the inter-hierarchal relationship; mapping the source object oriented hierarchy into corresponding source relational tables; building a source series of joins between the source relational tables, the source series being ordered in a top-down order from a root of the source object oriented hierarchy; identifying a target class of the inter-hierarchal relationship; mapping the target object oriented hierarchy into corresponding target relational tables; building a target series of joins between the target relational tables, the target series comprising a first target series and a second target series, the first target series corresponding to the target class, a root of the target object oriented hierarchy, and intervening nodes between the target class
Type:
Grant
Filed:
May 14, 2003
Date of Patent:
September 5, 2006
Assignee:
International Business Machines Corporation