Zobrazeno 1 - 10
of 389
pro vyhledávání: '"Divyakant Agrawal"'
Publikováno v:
Proceedings of the VLDB Endowment. 16:1291-1304
System operators are often interested in extracting different feature streams from multi-dimensional data streams; and reporting their distributions at regular intervals, including the heavy hitters that contribute to the tail portion of the feature
Publikováno v:
Proceedings of the VLDB Endowment. 16:643-656
Consider a cloud server that owns a key-value store and provides a private query service to its clients. Preserving client privacy in this setting is difficult because the key-value store is public , and a client cannot encrypt or modify it. Therefor
Autor:
Xi Mao, Haoyan Geng, S R Rajesh, Hakan Hacıgümüş, Ming Dai, Tianhang Sun, Ye (Justin) Tang, Hao Zhang, Zongchang (Jim) Chen, Kevin Lai, Sujata Kosalge, Vijayshankar Raman, Jay Patel, Yanlai Huang, Zeleng Zhuang, Sagar Trehan, Sourashis Roy, Prashant Mishra, Zhi (Adam) Li, Indrajit Roy, Yupu Zhang, Junichi Tatemura, Li Liu, Mayank Singh Shishodia, Bo Huang, Raman Grover, Jagan Sankaranarayanan, Jianyi Liang, Yao Liu, Min Chen, Prasanna Venkatasubramanian, Divyakant Agrawal, Thanh Do, Yalan (Maya) Meng, Haoyu Gao, Tao Lin, Gensheng Zhang, Gokul Nath Babu Manoharan, Ramkumar Vadali, Kefei Zhang, Ankur Agiwal, Goetz Graefe, Jeffrey F. Naughton, Tao Zou
Publikováno v:
Proceedings of the VLDB Endowment. 14:2986-2997
Google services continuously generate vast amounts of application data. This data provides valuable insights to business users. We need to store and serve these planet-scale data sets under the extremely demanding requirements of scalability, sub-sec
In this paper, we propose the first deterministic algorithms to solve the frequency estimation and frequent item problems in the bounded-deletion model. We establish the space lower bound for solving the deterministic frequent items problem in the bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a8b7e27e845a95f0fd866c0a7b2dcd5
http://arxiv.org/abs/2112.03462
http://arxiv.org/abs/2112.03462
Publikováno v:
SOSP
Given a private string q and a remote server that holds a set of public documents D, how can one of the K most relevant documents to q in D be selected and viewed without anyone (not even the server) learning anything about q or the document? This is
Publikováno v:
SIGMOD Conference
Scalability is one of the main roadblocks to business adoption of blockchain systems. Despite recent intensive research on using sharding techniques to enhance the scalability of blockchain systems, existing solutions do not efficiently address cross
Publikováno v:
SIGMOD Conference
The unique features of blockchains such as immutability, transparency, provenance, and authenticity have been used by many large-scale data management systems to deploy a wide range of distributed applications including supply chain management, healt
Publikováno v:
Proceedings of the VLDB Endowment. 12:1385-1398
Despite recent intensive research, existing blockchain systems do not adequately address all the characteristics of distributed applications. In particular, distributed applications collaborate with each other following service level agreements (SLAs
Publikováno v:
Proceedings of the VLDB Endowment. 12:611-623
Data storage in the Cloud needs to be scalable and fault-tolerant. Atomic commitment protocols such as Two Phase Commit (2PC) provide ACID guarantees for transactional access to sharded data and help in achieving scalability. Whereas consensus protoc
Publikováno v:
ICDE
Geo-distributed databases are the state of the art tools for managing cloud-based data. But maintaining hot records in geo-distributed databases such as Google’s Spanner can be expensive, as it synchronizes each update across a majority of replicas