Abstract
Hidden graphs are flexible abstractions that are composed of a set of known vertices (nodes), whereas the set of edges are not known in advance. To uncover the set of edges, multiple edge probing queries must be executed by evaluating a function f(u, v) that returns either true or false, if nodes u and v are connected or not respectively. Evidently, the graph can be revealed completely if all possible \(n(n-1)/2\) probes are executed for a graph containing n nodes. However, the function f() is usually computationally intensive and therefore executing all possible probing queries result in high execution costs. The target is to provide answers to useful queries by executing as few probing queries as possible. In this work, we study the problem of discovering the top-k nodes of a hidden bipartite graph with the highest degrees, by using distributed algorithms. In particular, we use Apache Spark and provide experimental results showing that significant performance improvements are achieved in comparison to existing centralized approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Springer, New York (2010). https://doi.org/10.1007/978-1-4419-6045-0
Alon, N., Asodi, V.: Learning a hidden subgraph. SIAM J. Discrete Math. 18(4), 697–712 (2005)
Bouvel, M., Grebinski, V., Kucherov, G.: Combinatorial search on graphs motivated by bioinformatics applications: a brief survey. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 16–27. Springer, Heidelberg (2005). https://doi.org/10.1007/11604686_2
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653–750 (1998)
Strouthopoulos, P., Papadopoulos, A.N.: Core discovery in hidden graphs. CoRR (to appear in Data and Knowledge Engineering) abs/1712.02827 (2017)
Tao, Y., Sheng, C., Li, J.: Finding maximum degrees in hidden bipartite graphs. In: Proceedings ACM International Conference on Management of Data (SIGMOD), Indianapolis, IN, pp. 891–902 (2010)
White, T.: Hadoop: The Definitive Guide, 4th edn. O’Reilly Media Inc., Sebastopol (2015)
Yiu, M.L., Lo, E., Wang, J.: Identifying the most connected vertices in hidden bipartite graphs using group testing. IEEE Trans. Knowl. Data Eng. 25(10), 2245–2256 (2013)
Zaharia, M., et al.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56–65 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kostoglou, P., Papadopoulos, A.N., Manolopoulos, Y. (2019). Distributed Computation of Top-k Degrees in Hidden Bipartite Graphs. In: Welzer, T., et al. New Trends in Databases and Information Systems. ADBIS 2019. Communications in Computer and Information Science, vol 1064. Springer, Cham. https://doi.org/10.1007/978-3-030-30278-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-30278-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30277-1
Online ISBN: 978-3-030-30278-8
eBook Packages: Computer ScienceComputer Science (R0)