Fast and Scalable Classification of Structured Data in the Network
暂无分享,去创建一个
Sajal K. Das | Sourav Pal | Christoph L. Schuba | Sumantra R. Kundu | Sourav Pal | C. Schuba | Sajal K. Das
[1] Mark Handley,et al. Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.
[2] Michael Mitzenmacher,et al. Compressed bloom filters , 2001, PODC '01.
[3] D. B. Davis,et al. Sun Microsystems Inc. , 1993 .
[4] A. Kumar,et al. Space-code bloom filter for efficient per-flow traffic measurement , 2004, IEEE INFOCOM 2004.
[5] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[6] Tim Furche,et al. An efficient single-pass query evaluator for XML data streams , 2004, SAC '04.
[7] Alex C. Snoeren,et al. Mesh-based content routing using XML , 2001, SOSP.
[8] Eddie Kohler,et al. The Click modular router , 1999, SOSP.
[9] Susan T. Dumais,et al. Personalized information delivery: an analysis of information filtering methods , 1992, CACM.
[10] Devavrat Shah,et al. Maintaining Statistics Counters in Router Line Cards , 2002, IEEE Micro.
[11] Jeffrey Considine,et al. Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.
[12] Ioana Manolescu,et al. Dynamic XML documents with distribution and replication , 2003, SIGMOD '03.
[13] Michael R. Anderberg,et al. Cluster Analysis for Applications , 1973 .
[14] Carsten Lund,et al. Estimating flow distributions from sampled flow statistics , 2005, TNET.