Abstract: Apriori algorithms are popular data mining techniques for extracting association rules from a body of data. The computational complexity of these algorithms is reduced by representing itemset information at cells of a hypercube. The cells encode associations between the items of each transaction. Direct computation of a cell as a lexicographic combination of items accelerates the computation of itemsets, and thereby improves the computational runtime complexity of the apriori algorithm that discovers association rules. Even faster computation is achieved by a user selected cardinality that limits the maximum size of the itemsets.

Abstract: A method, apparatus, and article of manufacture provide the ability to perform an operation on a multi-platform heterogeneous network. Path alias table (PAT) information necessary to create a PAT is obtained by a server. The PAT information includes alias(es) and location information necessary to locate a desired path for the alias(es). The server resolves the alias(es) using the PAT information by finding the desired path for the alias(es) within the file system of the server, building the PAT, and storing the PAT in a memory on the server. A request for an operation (comprising an alias) is received from a client. The PAT is then examined for the alias. Once found, the requested operation is performed using the desired path that corresponds to the alias in the PAT.

Abstract: A system and method for building a hierarchical table is described. According to one embodiment, sorted data is stored within, or otherwise associated with, a newly created leaf node. The leaf node is then added to the table in a manner that ensures that after the addition is completed, all leaf nodes within the table will reside at a same level within the table hierarchy. Thus, the table is constructed in a balanced manner, and no re-balancing of the table is required after table construction has been completed. According to another aspect, a balanced table may be constructed incrementally such that users are allowed to access data stored within the table while additional, related data is added to a second table that is later merged with the table. This incremental approach may adapted to construct unbalanced, as well as balanced, tables.

Abstract: A system for optimization of database replication/synchronization includes a first computer-based device having software thereon for obtaining a state of condition a database object and associating a unique identifier with such database object, for altering form of the data and associating another unique identifier with such altered database object, and for determining the database object using the unique identifiers. The system can receive a replication request for updating data from a second computer for a database object on the second computer wherein the request contains a unique identifier comparatively equating to one of the identifiers on the first computer and sends either an instruction to second computer to perform a like alteration on the data or to send the changes to the database object.

Abstract: A computer system models human memory by deriving associations between objects, events, and the context of the computer user or users. These associations can be dynamically generated, changing depending on the behavior of the user and context. Examples of areas in which this system can be used include time management (e.g., a calendar that presents time-based groupings of objects), people management (e.g., use analysis of user communications to rank importance of people to the user, groupings, and associations between people/groups and other objects such as documents, email), and general computer management (e.g., use analysis of user behavior to identify important objects and objects that are related to a current focus and context of the computer user).

Abstract: Nodes of a web graph are distributed over a cluster of computers. Tables distributed over the computers map source (destination) locations to lists of destination (source) locations. To accommodate traversing hyperlinks forward, a table maps the location of a web page “X” to locations of all the web pages “X” links to. To accommodate traversing hyperlinks backward, a table maps the location of a web page “Y” to locations of all web pages that link to Y. URLs identifying web pages are mapped to fixed-sized checksums, reducing the storage required for each node, while providing a way to map a URL to a node. Mapping is chosen to preserve information about the web server component of the URL. Nodes can then be partitioned across the machines in the cluster such that nodes corresponding to URLs on the same web server are assigned to the same machine in the cluster.

Abstract: A system and method for performing click stream analysis is described. In one implementation, a Web log is processed to reconstruct a visit made by a user to a Web site. The Web log contains records representing actions performed by the user during the visit including any actions that may be designated a commerce event. A sequential identification is assigned to each record and the sequential identification is stored with the associated record in a database. Any records representing actions performed by the user that are designated as a commerce event are identified. The database is queried for a certain quantity of records representing actions performed by the user prior to and/or subsequent to the commerce event, based on the sequential identification assigned to each record.

Abstract: The invention provides a storage system that includes a policy manager. The policy manager has a user interface and a policy engine which encodes performance and workload requirements of tablespaces in a policy that is based on user input received through the user interface. Databases are connected to the policy manager and tablespaces are connected to the databases. The databases create the tablespaces, and the databases establish a storage allocation for the tablespace based on the policy. The policy manager detects if the tablespace is out of storage and automatically extends the storage allocation for the tablespace based on the policy, when the tablespace is out of storage.

Abstract: A method and system are described for reducing search for data in a directory scheme employing hash tables. The method involves compacting directory entries in a manner in which the directory entries will gradually migrate and concentrate at the highest level hash tables which coincide with early blocks in a hash table sequence representing the directory.

Abstract: System administrators are able to move data between volumes to better utilize system resources. As data is being moved, clients are able to access and modify the data from the source volume. The apparatus moves the data by repeatedly traversing the file system on the source volume and copying files to the destination volume. Modifications made by clients to the source volume are logged. Once the data has been moved the destination volume is updated with all client modifications.

Abstract: Use situations of storage devices utilizing a storage area network (SAN) are predicted and the devices are automatically managed on the basis of the predicted results. To manage the devices utilizing the SAN, there is established the policy prescribing actions each executed when some object to be judged satisfies some condition with regard to storage devices. Information concerning use situations of the devices is collected and a value of an object to be judged of the policy is calculated based on collected information to judge whether the value of the object to be judged satisfies a condition of the policy. When the condition is satisfied, the action of the policy is executed. The objects to be judged of the policy may be actual result values in the past, current values or prediction values in the future relative to use capacity of storages, the number of I/O operations of disk or fragmentation.