1525 search results - page 5 / 305 » From Databases to Graph Visualization |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
IIS
2003
14 years 11 months ago
2003
Current research on the VINLEN inductive database system is briefly reviewed and illustrated by selected results. The goal of research on VINLEN is to develop a methodology for de...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
IIWAS
2007
14 years 11 months ago
2007
By using database security metrics to evaluate how risky the current database environment is and visually displaying the metric results on graphs, database security visualization ...
170
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...