Sciweavers

36 search results - page 1 / 8
» A Discussion on the Design of Graph Database Benchmarks
Sort
View
TPCTC
2010
Springer
149views Hardware» more  TPCTC 2010»
13 years 2 months ago
A Discussion on the Design of Graph Database Benchmarks
Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interr...
David Dominguez-Sal, Norbert Martínez-Bazan...
HIPC
2005
Springer
13 years 10 months ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
IPPS
1998
IEEE
13 years 9 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
13 years 10 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
ICDE
2008
IEEE
106views Database» more  ICDE 2008»
13 years 11 months ago
DIPBench: An independent benchmark for Data-Intensive Integration Processes
— The integration of heterogeneous data sources is one of the main challenges within the area of data engineering. Due to the absence of an independent and universal benchmark fo...
Matthias Böhm, Dirk Habich, Wolfgang Lehner, ...