English
Related papers

Related papers: Models for Storage in Database Backends

200 papers

Provenance for database queries or scientific workflows is often motivated as providing explanation, increasing understanding of the underlying data sources and processes used to compute the query, and reproducibility, the capability to…

Programming Languages · Computer Science 2014-08-13 James Cheney , Amal Ahmed , Umut A. Acar

Data warehouses are overwhelmingly built through a bottom-up process, which starts with the identification of sources, continues with the extraction and transformation of data from these sources, and then loads the data into a set of data…

Databases · Computer Science 2010-09-02 Flavio Rizzolo , Iluju Kiringa , Rachel Pottinger , Kwok Wong

This paper presents a comprehensive analysis of performance trade offs between implementation choices for transaction runtime systems on persistent memory. We compare three implementations of transaction runtimes: undo logging, redo…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-04 Virendra Marathe , Achin Mishra , Amee Trivedi , Yihe Huang , Faisal Zaghloul , Sanidhya Kashyap , Margo Seltzer , Tim Harris , Steve Byan , Bill Bridge , Dave Dice

Explaining the decisions of AI has become vital for fostering appropriate user trust in these systems. This paper investigates explanations for a structured prediction task called ``text-to-SQL Semantic Parsing'', which translates a natural…

Information Retrieval · Computer Science 2024-11-26 Daking Rai , Rydia R. Weiland , Kayla Margaret Gabriella Herrera , Tyler H. Shaw , Ziyu Yao

AI models and services are used in a growing number of highstakes areas, resulting in a need for increased transparency. Consistent with this, several proposals for higher quality and more consistent documentation of AI data, models, and…

We present the first mechanized, succinct, practical, complete, and proven-faithful semantics for a modern regular expression language with backtracking semantics. We ensure its faithfulness by proving it equivalent to a preexisting…

Programming Languages · Computer Science 2026-04-08 Aurèle Barrière , Victor Deng , Clément Pit-Claudel

We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type…

Logic in Computer Science · Computer Science 2021-12-14 Deivid Vale , Niels van der Weide

Background: Good API documentation facilities the development process, improving productivity and quality. While the topic of API documentation quality has been of interest for the last two decades, there have been few studies to map the…

Software Engineering · Computer Science 2019-08-01 Alex Cummaudo , Rajesh Vasa , John Grundy

We address the problem of verifying safety properties of concurrent programs running over the Total Store Order (TSO) memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels.…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Parosh Aziz Abdulla , Mohamed Faouzi Atig , Ahmed Bouajjani , Tuan Phong Ngo

Message-oriented-middleware (MOM) has become an small industry. MOM offers queued transaction processing as an advance over pure client-server transaction processing. This note makes four points: Queued transaction processing is less…

Databases · Computer Science 2007-05-23 Jim Gray

Large language model agents increasingly depend on memory to sustain long horizon interaction, but existing frameworks remain limited. Most expose only a few basic primitives such as encode, retrieve, and delete, while higher order…

Computation and Language · Computer Science 2025-10-24 Yi Wang , Lihai Yang , Boyu Chen , Gongyi Zou , Kerun Xu , Bo Tang , Feiyu Xiong , Siheng Chen , Zhiyu Li

Formal semantics offers a complete and rigorous definition of a language. It is important to define different semantic models for a language and different models serve different purposes. Building equivalence between different semantic…

Logic in Computer Science · Computer Science 2010-02-18 Shamim H. Ripon , Michael Butler

We present a preliminary proposal for an analytical model for evaluating the impact on performance of data access patterns in concurrent transaction execution. We consider the case of concurrency control protocols that use locking to ensure…

Performance · Computer Science 2021-10-19 Pierangelo Di Sanzo

Natural language user interfaces to database systems have been studied for several decades now. They have mainly focused on parsing and interpreting natural language queries to generate them in a formal database language. We envision the…

Databases · Computer Science 2009-09-15 Alkis Simitsis , Yannis Ioannidis

A model of computer system security operation is developed based on the fork-join queueing network formalism. We introduce a security operation performance measure, and show how it may be used to performance evaluation of actual systems.

Cryptography and Security · Computer Science 2024-06-11 D. Guster , N. K. Krivulin

The software patterns provide building blocks to the design and implementation of a software system, and try to make the software engineering to progress from experience to science. The software patterns were made famous because of the…

Logic in Computer Science · Computer Science 2021-10-26 Yong Wang

Double sided auctions are widely used in financial markets to match demand and supply. Prior works on double sided auctions have focused primarily on single quantity trade requests. We extend various notions of double sided auctions to…

Computer Science and Game Theory · Computer Science 2021-04-20 Raja Natarajan , Suneel Sarswat , Abhishek Kr Singh

This text reports in detail how SEAL, a modeling framework for the economy based on individual agents and firms, works. Thus, it aims to be an usage manual for those wishing to use SEAL or SEAL's results. As a reference work, theoretical…

Multiagent Systems · Computer Science 2016-09-14 Bernardo Alves Furtado , Isaque Daniel Rocha Eberhardt , Alexandre Messa

This notes explains how standard algorithms that construct sorting networks have been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

Data Structures and Algorithms · Computer Science 2022-03-04 Laurent Théry

Growing privacy regulations and internal governance mandates are driving demand for fine-grained, context-sensitive access control in data management systems. Among competing approaches, content-based access control -- where access…

Databases · Computer Science 2026-04-20 Ahana Pradhan , Srinivas Karthik , Imtiyazuddin Shaik , Srinivas Vivek
‹ Prev 1 3 4 5 6 7 10 Next ›