English
Related papers

Related papers: Reconsidering Optimistic Algorithms for Relational…

200 papers

Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic concurrency control approach, which relies on transactions…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-11-21 Paweł T. Wojciechowski , Konrad Siek

Managing the configurations of a database system poses significant challenges due to the multitude of configuration knobs that impact various system aspects.The lack of standardization, independence, and universality among these knobs…

Artificial Intelligence · Computer Science 2023-06-27 Karthick Prasad Gunasekaran , Kajal Tiwari , Rachana Acharya

The question why deep learning algorithms generalize so well has attracted increasing research interest. However, most of the well-established approaches, such as hypothesis capacity, stability or sparseness, have not provided complete…

Machine Learning · Computer Science 2017-11-07 Tom Zahavy , Bingyi Kang , Alex Sivak , Jiashi Feng , Huan Xu , Shie Mannor

Though large language models (LLMs) have demonstrated exceptional performance across numerous problems, their application to predictive tasks in relational databases remains largely unexplored. In this work, we address the notion that LLMs…

Machine Learning · Computer Science 2024-11-19 Marek Wydmuch , Łukasz Borchmann , Filip Graliński

Efficient search operations in databases are paramount for timely retrieval of information various applications. This research introduces a novel approach, combining dynamicalgorithm1 selection and caching2 strategies, to optimize search…

Databases · Computer Science 2023-11-15 Hakikat Singh

Current operating systems are complex systems that were designed before today's computing environments. This makes it difficult for them to meet the scalability, heterogeneity, availability, and security challenges in current cloud and…

There has been a significant amount of work in the literature proposing semantic relaxation of concurrent data structures for improving scalability and performance. By relaxing the semantics of a data structure, a bigger design space, that…

Data Structures and Algorithms · Computer Science 2025-11-11 Adones Rukundo , Aras Atalar , Philippas Tsigas

In this paper, we propose a concurrency control protocol, called the Prudent-Precedence Concurrency Control (PPCC) protocol, for high data contention database environments. PPCC is prudently more aggressive in permitting more serializable…

Databases · Computer Science 2016-11-18 Weidong Xiong , Feng Yu , Mohammed Hamdi , Wen-Chi Hou

Large Language Models (LLMs) often struggle with requests related to information retrieval and data manipulation that frequently arise in real-world scenarios under multiple conditions. In this paper, we demonstrate that leveraging tabular…

Artificial Intelligence · Computer Science 2026-01-09 Jio Oh , Geon Heo , Seungjun Oh , Hyunjin Kim , JinYeong Bak , Jindong Wang , Xing Xie , Steven Euijong Whang

In the rapidly evolving AI era with large language models (LLMs) at the core, making LLMs more trustworthy and efficient, especially in output generation (inference), has gained significant attention. This is to reduce plausible but faulty…

Databases · Computer Science 2024-12-25 Kyoungmin Kim , Anastasia Ailamaki

Modern applications, such as social networking systems and e-commerce platforms are centered around using large-scale storage systems for storing and retrieving data. In the presence of concurrent accesses, these storage systems trade off…

Programming Languages · Computer Science 2021-03-05 Ranadeep Biswas , Diptanshu Kakwani , Jyothi Vedurada , Constantin Enea , Akash Lal

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-11-18 Dan Alistarh , Keren Censor-Hillel , Nir Shavit

Advancement in Large Language Models (LLMs) reasoning capabilities enables them to solve scientific problems with enhanced efficacy. Thereby, a high-quality benchmark for comprehensive and appropriate assessment holds significance, while…

Neural models have shown impressive performance gains in answering queries from natural language text. However, existing works are unable to support database queries, such as "List/Count all female athletes who were born in 20th century",…

Computation and Language · Computer Science 2021-06-03 James Thorne , Majid Yazdani , Marzieh Saeidi , Fabrizio Silvestri , Sebastian Riedel , Alon Halevy

Database Management Systems (DBMS) are used ubiquitously. To efficiently access data, they apply sophisticated optimizations. Incorrect optimizations can result in logic bugs, which cause a query to compute an incorrect result set. We…

Software Engineering · Computer Science 2020-07-17 Manuel Rigger , Zhendong Su

Database Management Systems (DBMSs) are widely used to store, retrieve, and manage the data handled by modern applications. Although prior work has studied the co-evolution of DBMSs and application source code, less is known about DBMS…

The integration of Large Language Models (LLMs) into optimization has created a powerful synergy, opening exciting research opportunities. This paper investigates how LLMs can enhance existing optimization algorithms. Using their…

Artificial Intelligence · Computer Science 2025-02-13 Camilo Chacón Sartori , Christian Blum

Large language models (LLMs) are probabilistic in nature and perform more reliably when augmented with external information. As complex queries often require multi-step reasoning over the retrieved information, with no clear or…

Information Retrieval · Computer Science 2026-04-10 Roxana Petcu , Evangelos Kanoulas , Maarten de Rijke

Query optimization has played a central role in database research for decades. However, more often than not, the proposed optimization techniques lead to a performance improvement in some, but not in all, situations. Therefore, we urgently…

In this paper, we propose a radical new approach for scale-out distributed DBMSs. Instead of hard-baking an architectural model, such as a shared-nothing architecture, into the distributed DBMS design, we aim for a new class of so-called…

Databases · Computer Science 2020-09-07 Tiemo Bang , Norman May , Ilia Petrov , Carsten Binnig