Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Sungpack Hong"'
Publikováno v:
Journal of Parallel and Distributed Computing. 108:106-121
In recent years, many distributed graph-processing systems have been designed and developed to analyze large-scale graphs. For all distributed graph-processing systems, partitioning graphs is a key part of processing and an important aspect to achiev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a172ed6a9073a4df565fe6be9f6a415
https://doi.org/10.1016/j.jpdc.2016.02.003
https://doi.org/10.1016/j.jpdc.2016.02.003
Autor:
Hamid El Maazouz, Guido Wachsmuth, Sungpack Hong, Hassan Chafi, Martin Sevenich, Dalila Chiadmi
Publikováno v:
Learning and Analytics in Intelligent Systems ISBN: 9783030367770
Performance assessment is an essential verification practice in both research and industry for software quality assurance. Experiment setups for performance assessment tend to be complex. A typical experiment needs to be run for a variety of involved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::906c49205d8542665b67c6072ade687e
https://doi.org/10.1007/978-3-030-36778-7_28
https://doi.org/10.1007/978-3-030-36778-7_28
Autor:
Marnijati Torkel, David Chae, Sungpack Hong, Daniel Langerenken, Peter Eades, Hassan Chafi, Ziyang Wang, Seok-Hee Hong
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing
Graph Drawing
Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the effectiveness of Infom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd4d354bab60dd1300f705174a762c18
https://doi.org/10.1007/978-3-030-35802-0_11
https://doi.org/10.1007/978-3-030-35802-0_11
Publikováno v:
Proceedings of the VLDB Endowment. 9:1257-1268
Recently graph has been drawing lots of attention both as a natural data model that captures fine-grained relationships between data entities and as a tool for powerful data analysis that considers such relationships. In this paper, we present a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b925c6c888598ada477d56b9c9f8e2a4
https://doi.org/10.14778/3007263.3007265
https://doi.org/10.14778/3007263.3007265
Autor:
Geonhwa Jeong, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Kyoung-Min Kim, In Seo, Hassan Chafi, Hyungyu Shin
Publikováno v:
SIGMOD Conference
A dynamic graph is defined by an initial graph and a graph update stream consisting of edge insertions and deletions. Identifying and monitoring critical patterns in the dynamic graph is important in various application domains such as fraud detectio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::536530d39d8b91303a703c07f6c8ce69
https://doi.org/10.1145/3183713.3196917
https://doi.org/10.1145/3183713.3196917
Autor:
Nicholas Roth, Vasileios Trigonakis, Hassan Chafi, Boris Motik, Sungpack Hong, Anthony Potter, Ian Horrocks
Publikováno v:
GRADES@SIGMOD/PODS
Graph querying and pattern matching is becoming an important feature of graph processing as it allows data analysts to easily collect and understand information about their graphs in a way similar to SQL for databases. One of the key challenges in gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8a1848adbea972103a4eb4d273a4ead
https://doi.org/10.1145/3078447.3078454
https://doi.org/10.1145/3078447.3078454
Publikováno v:
GRADES
In the last years researchers and industry have become interested in the analysis of graphs to gain insights into social networks, road networks, and other data that is naturally organized as a set of connected entities. Many of these graphs are very
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97f151f5d9a92d87d34ffa45cfd41e1b
https://doi.org/10.1145/2960414.2960422
https://doi.org/10.1145/2960414.2960422
Publikováno v:
GRADES
Graph-based approaches to data analysis have become more widespread, which has given need for a query language for graphs. Such a graph query language needs not only SQL-like functionality for querying structured data, but also intrinsic support for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee65e20d29529df9e88e65d7b33d8a49
https://doi.org/10.1145/2960414.2960421
https://doi.org/10.1145/2960414.2960421
Publikováno v:
ASPLOS
The increasing importance of graph-data based applications is fueling the need for highly efficient and parallel implementations of graph analysis software. In this paper we describe Green-Marl, a domain-specific language (DSL) whose high level langu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c3e2a2011fce596622ed9220708508b
https://doi.org/10.1145/2248487.2151013
https://doi.org/10.1145/2248487.2151013
Publikováno v:
ISCA
The explosion of digital data and the ever-growing need for fast data analysis have made in-memory big-data processing in computer systems increasingly important. In particular, large-scale graph processing is gaining attention due to its broad appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c89832c3b1f5ae8e4b56d4ac589a99d2
https://doi.org/10.1145/2749469.2750386
https://doi.org/10.1145/2749469.2750386