I/O efficient computation of First Order Markov Measures for Large and Evolving Graphs
2008-07-21
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
I/O efficient computation of First Order Markov Measures for Large and Evolving Graphs
Authors
Published Date
2008-07-21
Publisher
Type
Report
Abstract
First order Markov measures, such as PageRank, have gained significance as relevance measure in domains where data is represented as a graph. The large scale of such graphs in real world, such as the World Wide Web has given rise to computing challenges of such measures. In this paper, we address the challenges of computing such First-order Markov measure, considering PageRank as the example of such a measure. We address two challenging computational scenarios for PageRank: (a) computation for a large single graph at a given time instance and (b) incremental computation for large evolving graphs. We achieve efficiency by reducing the problem size and reducing the number of iterations to compute. For (a) we bin the nodes in different partitions and for the subgraph formed by each of these partitions we use the nature of the firstorder Markov model to break down the problem of computation. For (b) we propose a method to accommodate the changed edges and nodes into new partitions and existing partitions and identify the subset of partitions for which recomputation is necessary. For each identified partition we use an incremental approach to compute the measure in expedited manner. Our results show significant reduction in time for computing for our approaches to both these problems.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Desikan, Prasanna; Srivastava, Jaideep. (2008). I/O efficient computation of First Order Markov Measures for Large and Evolving Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215767.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.