ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 41 Issue 3, August 2016

Scalable Atomic Visibility with RAMP Transactions
Peter Bailis, Alan Fekete, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica
Article No.: 15
DOI: 10.1145/2909870

Databases can provide scalability by partitioning data across several servers. However, multipartition, multioperation transactional access is often expensive, employing coordination-intensive locking, validation, or scheduling mechanisms....

Private and Scalable Execution of SQL Aggregates on a Secure Decentralized Architecture
Quoc-Cuong To, Benjamin Nguyen, Philippe Pucheral
Article No.: 16
DOI: 10.1145/2894750

Current applications, from complex sensor systems (e.g., quantified self) to online e-markets, acquire vast quantities of personal information that usually end up on central servers where they are exposed to prying eyes. Conversely, decentralized...

A Declarative Framework for Linking Entities
Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan
Article No.: 17
DOI: 10.1145/2894748

We introduce and develop a declarative framework for entity linking and, in particular, for entity resolution. As in some earlier approaches, our framework is based on a systematic use of constraints. However, the constraints we adopt are...

Bounded Repairability for Regular Tree Languages
Pierre Bourhis, Gabriele Puppis, Cristian Riveros, Sławek Staworko
Article No.: 18
DOI: 10.1145/2898995

We study the problem of bounded repairability of a given restriction tree language R into a target tree language T. More precisely, we say that R is bounded repairable with respect to T if there exists a bound on the...

B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
Michael A. Bender, Roozbeh Ebrahimi, Haodong Hu, Bradley C. Kuszmaul
Article No.: 19
DOI: 10.1145/2907945

Most B-tree articles assume that all N keys have the same size K, that f = B/K keys fit in a disk block, and therefore that the search cost is O(logf + 1N) block transfers....

Monadic Datalog and Regular Tree Pattern Queries
Filip Mazowiecki, Filip Murlak, Adam Witkowski
Article No.: 20
DOI: 10.1145/2925986

Containment of monadic datalog programs over trees is decidable. The situation is more complex when tree nodes carry labels from an infinite alphabet that can be tested for equality. It then matters whether the descendant relation is allowed or...