1 Introduction Peer-to-Peer Research at Stanford (2008)
Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-molina, ...
1 Introduction Peer-to-Peer Research at Stanford (2008)
Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-molina, ...
Minimizing View Sets without Losing (2008)
Query-answering Power, Chen Li, Mayank Bawa
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, we often need to...
ABSTRACT The Price of Validity in Dynamic Networks (2008)
Mayank Bawa, Aristides Gionis, Hector Garcia-molina, Rajeev Motwani
1 Introduction Peer-to-Peer Research at Stanford (2008)
Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-molina, ...
Pradeep Shenoy, Jayant R. Haritsa, S. Sudarshan, Gaurav Bhalotia, Mayank Bawa, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Minimizing View Sets without Losing (2007)
Query-answering Power, Chen Li, Mayank Bawa, Jeffrey D. Ullman
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, we often need to...
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...
LSH forest: self-tuning indexes for similarity search (2005)
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...
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...
The Price of Validity in Dynamic Networks (2004)
Mayank Bawa, Aristides Gionis, Hector Garcia-molina, Rajeev Motwani
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts...
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...
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...
Make it Fresh, Make it Quick --- Searching a Network of Personal Webservers (2003)
Bawa, Mayank, Rajagopalan, Sridhar, Shekita, Eugene J.
Personal webservers have proven to be a popular means of sharing files and peer collaboration. Unfortunately, the transient availability and rapidly evolving content on such hosts render centralized,...
Make it fresh, make it quick – searching a network of personal webservers (2003)
Mayank Bawa, Sridhar Rajagopalan
Personal webservers have proven to be a popular means of sharing files and peer collaboration. Unfortunately, the transient availability and rapidly evolving content on such hosts render centralized,...
Symphony: Distributed hashing in a small world (2003)
Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan, Verity Inc
We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance...
Estimating aggregates on a peer-to-peer network (2003)
Mayank Bawa, Hector Garcia-molina, Aristides Gionis, Rajeev Motwani
As Peer-to-Peer (P2P) networks become popular, there is an emerging need to collect a variety of statistical summary information about the participating nodes. The P2P networks of today lack...
Privacy-Preserving Indexing of Documents on the Network (2003)
Mayank Bawa, Roberto J. Bayardo, Rakesh Agrawal
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in...
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...
Privacy-Preserving Indexing of Documents on the (2003)
Network Mayank Bawa, Mayank Bawa
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in...
Privacy-preserving indexing of documents on the network (2003)
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in...
ABSTRACT SETS: Search Enhanced by Topic Segmentation (2003)
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arrange participating...
SETS: Search Enhanced by Topic Segmentation (2003)
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arrange participating...
Privacy-Preserving Indexing of Documents on the (2003)
Network Mayank Bawa, Mayank Bawa, Roberto J. Bayardo, Jr. Rakesh Agrawal
We address the problem of providing privacypreserving search over distributed accesscontrolled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in...
Transience of peers and streaming media (2002)
Mayank Bawa, Hrishikesh Deshp, Hector Garcia-molina
Application level multicast schemes have traditionally been evaluated with respect to the e ciency penalties incurred in migrating the multicast functionality from the network layer to the...
Transience of peers and streaming media (2002)
Mayank Bawa, Hrishikesh Deshp, Hector Garcia-molina
Application level multicast schemes have traditionally been evaluated with respect to the efficiency penalties incurred in migrating the multicast functionality from the network layer to the...
Protecting the pipe from malicious peers (2002)
Brian F. Cooper, Mayank Bawa, Neil Daswani, Hector Garcia-molina
Digital materials can be protected from failures by replicating them at multiple autonomous, distributed sites. A Peerto-peer Information Preservation and Exchange (PIPE) network is a good way to...
Minimizing view sets without losing query-answering power (2001)
Chen Li, Mayank Bawa, Jeffrey D. Ullman
The problem of answering queries using views has been studied extensively, due to its relevance in a wide variety of data-management applications. In these applications, we often need to select a...
Turbo-charging vertical mining of large databases (2000)
Shenoy, Pradeep, Haritsa, Jayant R, Sudarshan, S, Bhalotia, Gaurav, Bawa, Mayank, Shah, Devavart
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Turbo-charging Vertical Mining of Large Databases (2000)
Pradeep Shenoy, Gaurav Bhalotia, Mayank Bawa, S. Sudarshan, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Turbo-charging Vertical Mining of Large Databases (2000)
Pradeep Shenoy, Gaurav Bhalotia, Mayank Bawa, S. Sudarshan, Devavrat Shah
In a vertical representation of a market-basket database, each item is associated with a column of values representing the transactions in which it is present. The association-rule mining algorithms...
Minimizing View Sets without Losing Query-Answering Power (2000)
Chen Li, Mayank Bawa, Jeffrey D. Ullman
The problem of answering queries using views has been studied extensively, due to its relevance in a wide variety of data-management applications. In these applications, we often need to select a...