Prasanna Ganesan

Publication List Details

Period

2002 - 2008

Number

29

Co-Authors

Primitives for Workload Summarization and Implications for SQL (2008)

Surajit Chaudhuri, Prasanna Ganesan, Vivek Narasayya

Workload information has proved to be a crucial component for database-administration tasks as well as for analysis of query logs to understand user behavior and system usage. These tasks require the...

Abstract Optimal Routing in Chord (2008)

Prasanna Ganesan, Gurmeet Singh Manku

We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2 b nodes arranged in a circle, with edges connecting...

Adlib: A selftuning index for dynamic peer-to-peer systems (2005)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Peer-to-peer (P2P) systems enable queries over a large database horizontally partitioned across a dynamic set of nodes. We devise a self-tuning index for such systems that can trade off index...

Adlib: A selftuning index for dynamic peer-to-peer systems (2005)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Abstract Peer-to-peer (P2P) systems enable queries over a largedatabase horizontally partitioned across a dynamic set of nodes. We devise a self-tuning index for such systems thatcan trade off index...

LSH Forest: Self-Tuning Indexes for Similarity Search (2005)

Mayank Bawa, Tyson Condie, Prasanna Ganesan

We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of settings: Web search...

On Cooperative Content Distribution and the Price of Barter (2005)

Prasanna Ganesan Stanford, Prasanna Ganesan

We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing to upload data to...

On Cooperative Content Distribution and the Price of Barter (2005)

Prasanna Ganesan Stanford, Prasanna Ganesan

We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing to upload data to...

Adlib: A selftuning index for dynamic peer-to-peer systems (2005)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Peer-to-peer (P2P) systems enable queries over a large database horizontally partitioned across a dynamic set of nodes. We devise a self-tuning index for such systems that can trade off index...

Context information management using agents. (2004)

Ganesan, Prasanna.

Thesis (M.C.S.)--University of Ottawa, 2004.

Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems (2004)

Prasanna Ganesan, Mayank Bawa, Hector Garcia-molina

We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale...

One torus to rule them all: Multi-dimensional queries in p2p systems (2004)

Prasanna Ganesan, Beverly Yang, Hector Garcia-molina

Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo...

Canon in G major: Designing DHTs with hierarchical structure (2004)

Prasanna Ganesan

Distributed Hash Tables have been proposed as flat, nonhierarchical structures, in contrast to most scalable distributed systems of the past. We show how to construct hierarchical DHTs while...

DHT Routing using Social Links (2004)

Sergio Marti, Prasanna Ganesan, Hector Garcia-molina

Abstract — The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social...

DHT Routing Using Social Links (2004)

Sergio Marti Prasanna, Prasanna Ganesan, Hector Garcia-molina

The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social networks can...

One torus to rule them all: Multi-dimensional queries in p2p systems (2004)

Prasanna Ganesan, Beverly Yang, Hector Garcia-molina

Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo...

Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems (2004)

Prasanna Ganesan, Mayank Bawa, Hector Garcia-molina

We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale...

Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems (2004)

Prasanna Ganesan, Mayank Bawa, Hector Garcia-molina

Abstract We consider the problem of horizontally partition-ing a dynamic relation across a large number of disks/nodes by the use of range partitioning. Suchpartitioning is often desirable in...

Canon in G major: Designing DHTs with hierarchical structure (2004)

Prasanna Ganesan, Kandy Respectively

Distributed Hash Tables have been proposed as flat, nonhierarchical structures, in contrast to most scalable distributed systems of the past. We show how to construct hierarchical DHTs while...

Vision Paper: Enabling Privacy for the Paranoids (2004)

Gagan Aggarwal, Mayank Bawa, Prasanna Ganesan, Hector Garcia-molina, Krishnaram Kenthapadi, Nina Mishra, ...

P3P [27, 32] is a set of standards that allow corporations to declare their privacy policies. Hippocratic Databases [4] have been proposed to implement such policies within a corporation’s...

Apocrypha: Making p2p overlays network-aware (2003)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Abstract—Many distributed systems built on peer-to-peer principles organize nodes in an overlay network, in order to enable communication between nodes. In general, this overlay network may have...

YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology (2003)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and systems that explicitly...

YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology (2003)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Abstract — Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and systems that...

YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology (2003)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Abstract — Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and systems that...

Peer-to-Peer Research at Stanford (2003)

Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-molina, ...

this paper we present recent and ongoing research projects of the Peers research group at Stanford University. Section 2 studies the problems relating to locating resources in P2P systems. Section 3...

A case for locally-organized peer-to-peer lookup service (2002)

Prasanna Ganesan, Qixiang Sun, Hector Garcia-molina

Distributed lookup services have predominantly fallen into one of two categories: Gnutella-based systems and DHTs. In this paper, we identify a set of applications for P2P lookup services, and...