Abstract: A computer-implemented method of retrieving information in a first markup language through a query engine and presenting the information in any required markup language. A user inputs a query and may invoke a number of transformative sequences. These sequences contain a markup language pattern and an action, which may include transforming the tags in the first markup language to tags in a different markup language. The appropriate transformative sequence is selected and the pattern from the transformative sequence is compiled. The compiled pattern is used to perform rapid and efficient searches of documents in the database. A predicate check using the binary coding of the node as well as ancestor information confirms the node. The leaf information associated with a confirmed node is then stored. If necessary, the action from the transformative sequence is applied to change the markup language of the leaf information to that of the user.

Abstract: A computer-implemented method of retrieving information in a first markup language through a query engine and presenting the information in any required markup language. A user inputs a query and may invoke a number of transformative sequences. These sequences contain a markup language pattern and an action, which may include transforming the tags in the first markup language to tags in a different markup language. The appropriate transformative sequence is selected and the pattern from the transformative sequence is compiled. The compiled pattern is used to perform rapid and efficient searches of documents in the database. A predicate check using the binary coding of the node as well as ancestor information confirms the node. The leaf information associated with a confirmed node is then stored. If necessary, the action from the transformative sequence is applied to change the markup language of the leaf information to that of the user.

Abstract: A computer-implemented method of retrieving information in a first markup language through a query engine and presenting the information in any required markup language. A user inputs a query and may invoke a number of transformative sequences. These sequences contain a markup language pattern and an action, which may include transforming the tags in the first markup language to tags in a different markup language. The appropriate transformative sequence is selected and the pattern from the transformative sequence is compiled. The compiled pattern is used to perform rapid and efficient searches of documents in the database. A predicate check using the binary coding of the node as well as ancestor information confirms the node. The leaf information associated with a confirmed node is then stored. If necessary, the action from the transformative sequence is applied to change the markup language of the leaf information to that of the user.

Abstract: Visitor interests can be tracked by including “keyword directives” in content contained within the web site. These keyword directives specify a keyword indicating the type of category of information represented by the content. As the content is delivered to the visitor in the form of a web page, the number of keyword directives attached to the content is accumulated into a specified visitor profile. Over time, this visitor profile can represent the types of information the visitor has viewed and serve as an indicator of his or her preferences. In this way, the invention can accumulate a visitor profile unobtrusively, without requiring the visitors to fill out a survey or questionnaire. The profile may also be augmented with explicit information the visitor provides over time, such as a name or address provided when ordering a product from the site. The invention then delivers personalized pages to the visitor by examining such visitor's profile.

Abstract: A computer-implemented method of retrieving information in a first markup language through a query engine and presenting the information in any required markup language. A user inputs a query and may invoke a number of transformative sequences. These sequences contain a markup language pattern and an action, which may include transforming the tags in the first markup language to tags in a different markup language. The appropriate transformative sequence is selected and the pattern from the transformative sequence is compiled. The compiled pattern is used to perform rapid and efficient searches of documents in the database. A predicate check using the binary coding of the node as well as ancestor information confirms the node. The leaf information associated with a confirmed node is then stored. If necessary, the action from the transformative sequence is applied to change the markup language of the leaf information to that of the user.

Abstract: A computer-implemented method of retrieving information in a first markup language through a query engine and presenting the information in any required markup language. A user inputs a query and may invoke a number of transformative sequences. These sequences contain a markup language pattern and an action, which may include transforming the tags in the first markup language to tags in a different markup language. The appropriate transformative sequence is selected and the pattern from the transformative sequence is compiled. The compiled pattern is used to perform rapid and efficient searches of documents in the database. A predicate check using the binary coding of the node as well as ancestor information confirms the node. The leaf information associated with a confirmed node is then stored. If necessary, the action from the transformative sequence is applied to change the markup language of the leaf information to that of the user.

Abstract: A digital data storage apparatus has primary, secondary and backing storage elements characterized by respectively longer access times. A level detector signals when the quantity of data in the secondary store exceeds a threshold amount. A data migrator responds by moving selected data files from the secondary store to the backing store. The apparatus also includes a baseline back-up element that stores archive copies of a set of selected data files. A full back-up element stores archive copies of those files that, (1) were originally copied to the baseline back-up set but have since changed, or (2) are not otherwise within the baseline back-up set. For those files which were originally copied to the baseline back-up set and which have not changed, the full back-up element stores pointers indicating locations of the respective files in the baseline back-up set.