Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Mayank Bawa"'
Publikováno v:
VLDB
We address the problem of providing privacy-preserving search over distributed access-controlled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in search. The need to avoid breaches of access-control
Publikováno v:
Future Generation Computer Systems. 21:391-400
We describe a system, which we call a peer-to-peer information preservation and exchange (PIPE) network, for protecting, digital data collections from failure. A significant challenge in such networks is ensuring that documents are replicated and acc
Autor:
Hector Garcia-Molina, Beverly Yang, Patrick Vinograd, Mayank Bawa, Arturo Crespo, Qi Sun, Mario T. Schlosser, Brian F. Cooper, Neil Daswani, Prasanna Ganesan, Sepandar D. Kamvar, Sergio Marti
Publikováno v:
ACM SIGMOD Record. 32:23-28
n this paper we present recent and ongoing research projects of the Peers research group at Stanford University.
Publikováno v:
ACM SIGCOMM Computer Communication Review. 33:107-112
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 application layer. We argue that the current performance me
Publikováno v:
WWW
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 engines desire fast, parallel, main-memory-based index
Publikováno v:
VLDB
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 parallel databases, as well as in peer-to-peer (P2P) sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::591c8fd7c4a0e6ae64d458039ba12c41
https://doi.org/10.1016/b978-012088469-8.50041-3
https://doi.org/10.1016/b978-012088469-8.50041-3
Autor:
Nina Mishra, Krishnaram Kenthapadi, Dilys Thomas, Mayank Bawa, Utkarsh Srivastava, Rajeev Motwani, Hector Garcia-Molina, Prasanna Ganesan, Jennifer Widom, Gagan Aggarwal, Ying Xu
Publikováno v:
VLDB
P3P [23, 24] is a set of standards that allow corporations to declare their privacy policies. Hippocratic Databases [6] have been proposed to implement such policies within a corporation's datastore. From an end-user individual's point of view, both
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9551d2f0c4558a6d090f32092eb067cf
https://doi.org/10.1016/b978-012088469-8.50063-2
https://doi.org/10.1016/b978-012088469-8.50063-2
Publikováno v:
SIGIR
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 sites in a topic-segmented overlay topology in which m
Publikováno v:
WWW
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, crawl-based search indices stale and incomplete. T