![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Boon Thau Loo Ryan Huebsch , Brent N. Chun , Joseph M. Hellerstein , Boon Thau Loo, Petros Maniatis , Timothy Roscoe , Scott Shenker , Ion Stoica , Aydan R. Yumerefendi : The Architecture of PIER: an Internet-Scale Query Processor. CIDR 2005 : 28-43 Boon Thau Loo, Joseph M. Hellerstein , Ion Stoica , Raghu Ramakrishnan : Declarative routing: extensible routing with declarative queries. SIGCOMM 2005 : 289-300 Boon Thau Loo, Tyson Condie , Joseph M. Hellerstein , Petros Maniatis , Timothy Roscoe , Ion Stoica : Implementing declarative overlays. SOSP 2005 : 75-90 Boon Thau Loo, Ryan Huebsch , Ion Stoica , Joseph M. Hellerstein : The Case for a Hybrid P2P Search Infrastructure. IPTPS 2004 : 141-150 Brent N. Chun , Joseph M. Hellerstein , Ryan Huebsch , Shawn R. Jeffery , Boon Thau Loo, Sam Mardanbeigi , Timothy Roscoe , Sean C. Rhea , Scott Shenker , Ion Stoica : Querying at Internet-Scale. SIGMOD Conference 2004 : 935-936 Boon Thau Loo, Joseph M. Hellerstein , Ryan Huebsch , Scott Shenker , Ion Stoica : Enhancing P2P File-Sharing with an Internet-Scale Query Processor. VLDB 2004 : 432-443 Jinyang Li , Boon Thau Loo, Joseph M. Hellerstein , M. Frans Kaashoek , David R. Karger , Robert Morris : On the Feasibility of Peer-to-Peer Web Indexing and Search. IPTPS 2003 : 207-215 Ryan Huebsch , Joseph M. Hellerstein , Nick Lanham , Boon Thau Loo, Scott Shenker , Ion Stoica : Querying the Internet with PIER. VLDB 2003 : 321-332 Matthew Harren , Joseph M. Hellerstein , Ryan Huebsch , Boon Thau Loo, Scott Shenker , Ion Stoica : Complex Queries in DHT-based Peer-to-Peer Networks. IPTPS 2002 : 242-259 Chris Olston , Boon Thau Loo, Jennifer Widom : Adaptive Precision Setting for Cached Approximate Values. SIGMOD Conference 2001 : 355-366 1 [ 6 ] [ 10 ] 2 [ 8 ] 3 [ 2 ] 4 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 5 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 10 ] 6 [ 6 ] 7 [ 4 ] 8 [ 4 ] 9 [ 3 ] 10 [ 4 ] 11 [ 8 ] [ 10 ] 12 [ 6 ] 13 [ 4 ] 14 [ 1 ] 15 [ 9 ] 16 [ 6 ] 17 [ 6 ] [ 8 ] [ 10 ] 18 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 10 ] 19 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 20 [ 1 ] 21 [ 10 ] ![]() ©2006 Association for Computing Machinery |