Next Article in Journal
Local-Topology-Based Scaling for Distance Preserving Dimension Reduction Method to Improve Classification of Biomedical Data-Sets
Next Article in Special Issue
Distributed Graph Diameter Approximation
Previous Article in Journal
On a Nonsmooth Gauss–Newton Algorithms for Solving Nonlinear Complementarity Problems
Article

Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs

Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I-67100 L’Aquila, Italy
Algorithms 2020, 13(8), 191; https://doi.org/10.3390/a13080191
Received: 19 June 2020 / Revised: 29 July 2020 / Accepted: 2 August 2020 / Published: 4 August 2020
(This article belongs to the Special Issue Algorithmic Aspects of Networks)
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search optimization, database design and route planning. Standard algorithms for shortest paths (e.g., Dijkstra’s) do not scale well with the graph size, as they take more than a second or huge memory overheads to answer a single query on the distance for large-scale graph datasets. Hence, they are not suited to mine distances from big graphs, which are becoming the norm in most modern application contexts. Therefore, to achieve faster query answering, smarter and more scalable methods have been designed, the most effective of them based on precomputing and querying a compact representation of the transitive closure of the input graph, called the 2-hop-cover labeling. To use such approaches in realistic time-evolving scenarios, when the managed graph undergoes topological modifications over time, specific dynamic algorithms, carefully updating the labeling as the graph evolves, have been introduced. In fact, recomputing from scratch the 2-hop-cover structure every time the graph changes is not an option, as it induces unsustainable time overheads. While the state-of-the-art dynamic algorithm to update a 2-hop-cover labeling against incremental modifications (insertions of arcs/vertices, arc weights decreases) offers very fast update times, the only known solution for decremental modifications (deletions of arcs/vertices, arc weights increases) is still far from being considered practical, as it requires up to tens of seconds of processing per update in several prominent classes of real-world inputs, as experimentation shows. In this paper, we introduce a new dynamic algorithm to update 2-hop-cover labelings against decremental changes. We prove its correctness, formally analyze its worst-case performance, and assess its effectiveness through an experimental evaluation employing both real-world and synthetic inputs. Our results show that it improves, by up to several orders of magnitude, upon average update times of the only existing decremental algorithm, thus representing a step forward towards real-time distance mining in general, massive time-evolving graphs. View Full-Text
Keywords: large graph mining; algorithm engineering; experimental algorithmics; time-evolving data; big data processing large graph mining; algorithm engineering; experimental algorithmics; time-evolving data; big data processing
Show Figures

Figure 1

MDPI and ACS Style

D’Emidio, M. Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms 2020, 13, 191. https://doi.org/10.3390/a13080191

AMA Style

D’Emidio M. Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms. 2020; 13(8):191. https://doi.org/10.3390/a13080191

Chicago/Turabian Style

D’Emidio, Mattia. 2020. "Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs" Algorithms 13, no. 8: 191. https://doi.org/10.3390/a13080191

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop