299 search results - page 13 / 60 » On Graph Query Optimization in Large Networks |
107
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
207
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
109
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
127
Voted
DBSEC
2006
15 years 3 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
107
click to vote
DMSN
2004
ACM
15 years 7 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...