ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


Editorial: The Dark Citations of TODS Papers and What to Do about It—or: Cite the Journal Paper
Christian S. Jensen
Article No.: 8e
DOI: 10.1145/2946798


Section: Editorial

Sloth: Being Lazy Is a Virtue (When Issuing Database Queries)
Alvin Cheung, Samuel Madden, Armando Solar-Lezama
Article No.: 8
DOI: 10.1145/2894749

Many web applications store persistent data in databases. During execution, such applications spend a significant amount of time communicating with the database for retrieval and storing of persistent data over the network. These network...

Section: Editorial

Synchronization of Queries and Views Upon Schema Evolutions: A Survey
Loredana Caruccio, Giuseppe Polese, Genoveffa Tortora
Article No.: 9
DOI: 10.1145/2903726

One of the problems arising upon the evolution of a database schema is that some queries and views defined on the previous schema version might no longer work properly. Thus, evolving a database schema entails the redefinition of queries and views...

Capturing Missing Tuples and Missing Values
Ting Deng, Wenfei Fan, Floris Geerts
Article No.: 10
DOI: 10.1145/2901737

Databases in real life are often neither entirely closed-world nor entirely open-world. Databases in an enterprise are typically partially closed, in which a part of the data is constrained by master data that contains complete information...

Plan Bouquets: A Fragrant Approach to Robust Query Processing
Anshuman Dutt, Jayant R. Haritsa
Article No.: 11
DOI: 10.1145/2901738

Identifying efficient execution plans for declarative OLAP queries typically entails estimation of several predicate selectivities. In practice, these estimates often differ significantly from the values actually encountered during query...

Random Walk with Restart on Large Graphs Using Block Elimination
Jinhong Jung, Kijung Shin, Lee Sael, U Kang
Article No.: 12
DOI: 10.1145/2901736

Given a large graph, how can we calculate the relevance between nodes fast and accurately? Random walk with restart (RWR) provides a good measure for this purpose and has been applied to diverse data mining applications including ranking,...

The Exact Complexity of the First-Order Logic Definability Problem
Marcelo Arenas, Gonzalo I. Diaz
Article No.: 13
DOI: 10.1145/2886095

We study the definability problem for first-order logic, denoted by FO-Def. The input of FO-Def is a relational database instance I and a relation R; the question to answer is whether there exists a...

The Complexity of Learning Tree Patterns from Example Graphs
Sara Cohen, Yaacov Y. Weiss
Article No.: 14
DOI: 10.1145/2890492

This article investigates the problem of learning tree patterns that return nodes with a given set of labels, from example graphs provided by the user. Example graphs are annotated by the user as being either positive or negative....