Sciweavers

71 search results - page 4 / 15
» Call Graph Prefetching for Database Applications
Sort
View
KR
2004
Springer
15 years 5 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
13 years 2 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
89
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 12 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
80
Voted
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
15 years 12 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
CIKM
2009
Springer
15 years 6 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang