Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Manuel Then"'
Publikováno v:
Datenbank-Spektrum. 17:169-182
Distance and centrality computations are important building blocks for modern graph databases as well as for dedicated graph analytics systems. Two commonly used centrality metrics are the compute-intense closeness and betweenness centralities, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce8dc19dbfe4d233a2fa4ca29b47f7ed
https://doi.org/10.1007/s13222-017-0261-x
https://doi.org/10.1007/s13222-017-0261-x
Publikováno v:
Proceedings of the VLDB Endowment. 10:877-888
Analytical graph algorithms commonly compute metrics for a graph at one point in time. In practice it is often also of interest how metrics change over time, e.g., to find trends. For this purpose, algorithms must be executed for multiple graph snaps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4610daa9c5e4a36de9b7ccd23d6a0f3a
https://doi.org/10.14778/3090163.3090166
https://doi.org/10.14778/3090163.3090166
Autor:
Manuel Then, Viktor Leis, Tobias Muehlbauer, Alfons Kemper, Michael Haubenschild, Adrian Vogelsgesang, Thomas Neumann, Jan Finis
Publikováno v:
DBTest@SIGMOD
Industrial as well as academic analytics systems are usually evaluated based on well-known standard benchmarks, such as TPC-H or TPC-DS. These benchmarks test various components of the DBMS including the join optimizer, the implementation of the join
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ed261595d9ea4e101a012da82ca159a
https://doi.org/10.1145/3209950.3209952
https://doi.org/10.1145/3209950.3209952
Autor:
Tuan-Anh Hoang-Vu, Alfons Kemper, Kien Pham, Thomas Neumann, Huy T. Vo, Moritz Kaufmann, Fernando Chirigati, Manuel Then
Publikováno v:
Proceedings of the VLDB Endowment. 8:449-460
Graph analytics on social networks, Web data, and communication networks has been widely used in a plethora of applications. Many graph analytics algorithms are based on breadth-first search (BFS) graph traversal, which is not only time-consuming for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea85c2fb9002d1f22e4c3b5d6ed148e4
https://doi.org/10.14778/2735496.2735507
https://doi.org/10.14778/2735496.2735507
The Process Enactment Tool Framework —Transformation of software process models to prepare enactment
Publikováno v:
Science of Computer Programming. 79:172-188
Rich development process models contain information about structures for project organization and also for concrete outcomes of a project. However, rich processes are hard to implement. They often contain hundreds of pages of documentation. Developme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9de007844f69e3f6612322e034d5e256
https://doi.org/10.1016/j.scico.2012.03.007
https://doi.org/10.1016/j.scico.2012.03.007
Publikováno v:
GRADES
For many exploratory graph workloads, the initial loading and construction of the graph data structures makes up a significant part of the total runtime. Still, this topic is hardly analyzed in literature and often neglected in systems and their eval
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87d8816479b14e5de70a4b4ab70fdd62
https://doi.org/10.1145/2960414.2960418
https://doi.org/10.1145/2960414.2960418
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
Autor:
Andrey Gubichev, Manuel Then
Publikováno v:
GRADES
This paper presents an empirical study of how a wide spectrum of systems handle the graph pattern matching problem. Our approach is to take the well-known LUBM benchmark, model it across various domains (relational, RDF, property graph), and execute
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c77127f707ea131588d42389f97561cc
https://doi.org/10.1145/2621934.2621944
https://doi.org/10.1145/2621934.2621944