Name
Abstract | ||
|---|---|---|
Graphs provide a powerful way to model complex structures such as chemical compounds, proteins, images, and program dependence. The previous practice for experiments in graph indexing techniques is that the author of a newly proposed technique does not implement existing indexes on his own code base, but instead uses the original authors' binary executables and reports only the wall clock time. However, we observed that this practice may result in several problems [6]. In order to address these problems, we have implemented all representative graph indexing techniques on a common framework called iGraph [6]. In this demonstration we showcase iGraph and its visual tools using several real datasets and their workloads. For selected queries of the workloads, we show several unique features including visual performance analysis. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1989323.1989464 | SIGMOD Conference |
Keywords | Field | DocType |
representative graph indexing technique,disk-based graph indexing technique,complex structure,binary executables,graph indexing technique,previous practice,common framework,showcase igraph,visual tool,chemical compound,visual performance analysis,visualization,indexation | Data mining,Graph,Graph indexing,Visualization,Computer science,Theoretical computer science,Database,Executable,Binary number | Conference |
Citations | PageRank | References |
4 | 0.41 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wook-Shin Han | 1 | 805 | 57.85 |
| Minh-Duc Pham | 2 | 220 | 10.55 |
| Jinsoo Lee | 3 | 127 | 6.95 |
| Romans Kasperovics | 4 | 9 | 2.59 |
| Jeffrey Xu Yu | 5 | 7018 | 464.96 |