Abstract: A user creates a rule defining file objects to appear at an arbitrary insertion point in a hierarchical file structure. Every request for a file, directory, etc. at the insertion point invokes the rule and constructs a set of dynamic links to actual locations of all file objects that satisfy the rule. Any operations performed by the program on the objects take place transparently on the objects at their actual locations. Between requests, the actual links go away, and only the rule for constructing them remains. An indexer operates continually to maintain current information on all files in the structure.

Abstract: A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage to evaluate assignment statements includes a data manager that mutates selected string operations into equivalent functions on a LOB operand that can be left in the data base, thereby eliminating the associated storage access operations. When the data manager receives an assignment statement containing one or more LOBs, the data manager first checks to determine if the statement can be mutated. If the statement can be mutated, then the mutation is performed. The mutated statement is then processed according to a conventional deleted evaluation scheme. If the assignment statement cannot be mutated, then the statement is evaluated according to a conventional deleted evaluation scheme.