Abstract: A solution is provided that efficiently tracks user paths within a large network. Raw node visit data may be received that indicates which users visited which nodes in the network at which time. This data may then be organized into sessions. Unique pathviews may be calculated for each session of the nodes visit data as well as the frequency of occurrence of each unique path view. This information may then be used to understand how users are progressing through a network.

Abstract: In an embodiment of the present invention, a record is read a single time, and it is evaluated against all conditions to identify the ones that it satisfies. By organizing the conditions into appropriate data structures, the process may be further optimized by ensuring that the record is not scanned multiple times.

Abstract: A solution is provided wherein path information is stored for efficient retrieval. Raw path information may be stored in a path file. A node path index file may then be created containing entries for each of one or more corresponding nodes in the path information. Each node path entry corresponds to a unique appearance of the corresponding node in the path file, and wherein each node path entry contains a path file offset and a position of the corresponding node in the path file in the path indicated by the path file offset. A node index file may then be created containing, for one or more nodes in the path information, a single node entry containing an indication of the number of times the corresponding node in the node path index file appears in the node path index file and also containing a node path index file offset.

Abstract: In an embodiment of the present invention, a record is read a single time, and it is evaluated against all conditions to identify the ones that it satisfies. By organizing the conditions into appropriate data structures, the process may be further optimized by ensuring that the record is not scanned multiple times.

Abstract: A solution is provided wherein a master process and two or more drone processes may be utilized to identify path information containing a pattern. The master process may send the pattern to the two or more drone processes, which may identify the pattern in path data. Each drone process may then send the paths that satisfy the pattern back to the master process, which may aggregate the path data so that two or more identical paths appearing in the path data are reduced to a single occurrence of a path.

Abstract: A solution is provided that efficiently tracks user paths within a large network. Raw node visit data may be received that indicates which users visited which nodes in the network at which time. This data may then be organized into sessions. Unique pathviews may be calculated for each session of the nodes visit data as well as the frequency of occurrence of each unique path view. This information may then be used to understand how users are progressing through a network.