Patent Document ID: 9275117
Application ID: 13706487

Base Claim:
1. A method of performing dependency mining, comprising: determining a block data source access sequence; splitting the block data source access sequence into a plurality of subsequences that represent a sequence of block accesses; determining an access pattern for each of the plurality of subsequences; constructing at least one search tree based on the access pattern of each of the plurality of subsequences; performing a search task using the at least one search tree; determining dependent blocks using the at least one search tree and based on block dependency criteria, wherein each access pattern is an activity vector that identifies occurrences of a particular block in the plurality of subsequences; outputting a dependency mining search result based on the search task and the block dependency criteria; and using the dependency mining search result in a storage management process in connection with at least one of the determined dependent blocks, wherein the block dependency criteria includes a second block being dependent on a first block in response to a confidence factor being greater than a predetermined threshold, the confidence factor corresponding to a number of occurrences where both the first block and second block are active divided by a number of occurrences where the first block is active, wherein subsets of the plurality of subsequences are grouped into a plurality of subset groups according to weighting characteristics of the block dependency criteria for each access pattern of the plurality of subsequences.

---

Claim 3:
3. The method according to claim 1 , wherein more than one search tree is constructed, wherein the search task includes traversing the more than one search tree, and wherein the dependency mining search result is an aggregated result of traversing the more than one search tree.