Zobrazeno 1 - 10
of 370
pro vyhledávání: '"Agrawal, Divyakant"'
Database queries traditionally operate under the closed-world assumption, providing no answers to questions that require information beyond the data stored in the database. Hybrid querying using SQL offers an alternative by integrating relational dat
Externí odkaz:
http://arxiv.org/abs/2408.00884
Judging the equivalence between two SQL queries is a fundamental problem with many practical applications in data management and SQL generation (i.e., evaluating the quality of generated SQL queries in text-to-SQL task). While the research community
Externí odkaz:
http://arxiv.org/abs/2312.10321
Autor:
Zhao, Fuheng, Agrawal, Divyakant, Abbadi, Amr El, Mathieu, Claire, Metwally, Ahmed, de Rougemont, Michel
In this paper, we present an advanced analysis of near optimal algorithms that use limited space to solve the frequency estimation, heavy hitters, frequent items, and top-k approximation in the bounded deletion model. We define the family of SpaceSav
Externí odkaz:
http://arxiv.org/abs/2309.12623
The Log Structured Merge Trees (LSM-tree) based key-value stores are widely used in many storage systems to support a variety of operations such as updates, point reads, and range reads. Traditionally, LSM-tree's merge policy organizes data into mult
Externí odkaz:
http://arxiv.org/abs/2305.05074
Linear sketches have been widely adopted to process fast data streams, and they can be used to accurately answer frequency estimation, approximate top K items, and summarize data distributions. When data are sensitive, it is desirable to provide priv
Externí odkaz:
http://arxiv.org/abs/2205.09873
Autor:
Amiri, Mohammad Javad, Wu, Chenyuan, Agrawal, Divyakant, Abbadi, Amr El, Loo, Boon Thau, Sadoghi, Mohammad
Byzantine Fault-Tolerant (BFT) protocols have recently been extensively used by decentralized data management systems with non-trustworthy infrastructures, e.g., permissioned blockchains. BFT protocols cover a broad spectrum of design dimensions from
Externí odkaz:
http://arxiv.org/abs/2205.04534
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:
http://arxiv.org/abs/2112.03462
Publikováno v:
Proceedings of the VLDB Endowment 15, no. 11 (2022)
Today's large-scale data management systems need to address distributed applications' confidentiality and scalability requirements among a set of collaborative enterprises. This paper presents Qanaat, a scalable multi-enterprise permissioned blockcha
Externí odkaz:
http://arxiv.org/abs/2107.10836
Distributed caches are widely deployed to serve social networks and web applications at billion-user scales. This paper presents Cache-on-Track (CoT), a decentralized, elastic, and predictive caching framework for cloud environments. CoT proposes a n
Externí odkaz:
http://arxiv.org/abs/2006.08067