Sciweavers

71 search results - page 6 / 15
» Call Graph Prefetching for Database Applications
Sort
View
CF
2007
ACM
15 years 3 months ago
An analysis of the effects of miss clustering on the cost of a cache miss
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
89
Voted
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 4 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
15 years 6 months ago
Materialized View Selection in XML Databases
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materia...
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. Tamer Ö...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
14 years 9 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 5 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han