Prasanna Ganesan Papers on DiSC'04 Factorizing Complex Predicates in Queries to Exploit Indexes Peer-to-peer research at Stanford Primitives for Workload Summarization and Implications for SQL Publications Note: Links lead to the DBLP on the Web. Prasanna Ganesan Prasanna Ganesan, Gurmeet Singh Manku : Optimal routing in Chord. SODA 2004 : 176-185 Prasanna Ganesan, Qixiang Sun , Hector Garcia-Molina : YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. INFOCOM 2003 Surajit Chaudhuri , Prasanna Ganesan, Sunita Sarawagi : Factorizing Complex Predicates in Queries to Exploit Indexes. SIGMOD Conference 2003 : 361-372 Surajit Chaudhuri , Prasanna Ganesan, Vivek R. Narasayya : Primitives for Workload Summarization and Implications for SQL. VLDB 2003 : 730-741 Prasanna Ganesan, Hector Garcia-Molina , Jennifer Widom : Exploiting hierarchical domain structure to compute similarity. ACM Trans. Inf. Syst. 21 (1): 64-93 (2003) Mayank Bawa , Brian Cooper , Arturo Crespo , Neil Daswani , Prasanna Ganesan, Hector Garcia-Molina , Sepandar D. Kamvar , Sergio Marti , Mario T. Schlosser , Qi Sun , Patrick Vinograd , Beverly Yang : Peer-to-peer research at Stanford. SIGMOD Record 32 (3): 23-28 (2003) 1 [ 1 ] 2 [ 3 ] [ 4 ] 3 [ 1 ] 4 [ 1 ] 5 [ 1 ] 6 [ 1 ] [ 2 ] [ 5 ] 7 [ 1 ] 8 [ 6 ] 9 [ 1 ] 10 [ 3 ] 11 [ 4 ] 12 [ 1 ] 13 [ 1 ] 14 [ 5 ] 15 [ 1 ] 16 [ 2 ] 17 [ 1 ] ©2004 Association for Computing Machinery