Sciweavers

1759 search results - page 131 / 352
» Distributed Paging
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
15 years 9 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
131
Voted
NETWORK
2011
14 years 6 months ago
Dynamic measurement-aware routing in practice
Traffic monitoring is a critical network operation for the purpose of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Existing techniques for...
Guanyao Huang, Chen-Nee Chuah, Saqib Raza, Srini S...
144
Voted
WWW
2003
ACM
16 years 4 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
230
Voted
ICDE
2004
IEEE
151views Database» more  ICDE 2004»
16 years 5 months ago
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...
Torsten Suel, Patrick Noel, Dimitre Trendafilov
SPAA
2004
ACM
15 years 9 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter