Christie I. Ezeife

Learn More
Processing costs in distributed environments is most often dominated by the network communications required for interprocess communication. It is well-known from distributed relational database design research that careful placement of data \near" the users or processors where it is used is mandatory or system performance will suuer greatly. Data placement(More)
A horizontal fragment of a database class in an object-oriented database system contains subsets of its instance objects (or class extents) reeecting the way applications are accessing database objects. Allocating well-deened fragments of classes to distributed sites has the advantage of minimizing transmission costs of data to remote sites as well as(More)
Owing to important applications such as mining web page traversal sequences, many algorithms have been introduced in the area of sequential pattern mining over the last decade, most of which have also been modified to support concise representations like closed, maximal, incremental or hierarchical sequences. This article presents a taxonomy of sequential(More)
New transaction insertions and old transaction deletions may lead to previously generated association rules no longer being interesting, and new interesting association rules may also appear. Existing association rules maintenance algorithms are Apriori-like, which mostly need to scan the entire database several times in order to update the previously(More)
Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively reconstructing intermediate WAP-trees, starting with their suffix subsequences. This paper proposes an efficient approach(More)
Data warehouse views typically store large aggregate tables based on a subset of dimension attributes of the main data warehouse fact table. Aggregate views can be stored as 2 n subviews of a data cube with n attributes. Methods have been proposed for selecting only some of the data cube views to materialize in order to speed up query response time,(More)
Since point and click at web pages generate continuous data stream, which flow into web log data, old patterns may be stale and need to be updated. Algorithms for mining web sequential patterns from scratch include WAP, PLWAP and apriori-based GSP. An incre-mental technique for updating already mined patterns when database changes, which is based on an(More)