Database Systems (TODS)


Search Issue
enter search term and/or author name


ACM Transactions on Database Systems (TODS) - Special Issue: Invited 2014 PODS and EDBT Revised Articles, Volume 40 Issue 4, February 2016

Section: Invited Papers from PODS 2014

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture
Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn
Article No.: 21
DOI: 10.1145/2809784

The CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if...

Generating Plans from Proofs
Michael Benedikt, Balder Ten Cate, Efthymia Tsamoura
Article No.: 22
DOI: 10.1145/2847523

We present algorithms for answering queries making use of information about source integrity constraints, access restrictions, and access costs. Our method can exploit the integrity constraints to find plans even when there is no direct access to...

Section: Invited Papers from PODS 2014

Processing Top-k Dominating Queries in Metric Spaces
Eleftherios Tiakas, George Valkanas, Apostolos N. Papadopoulos, Yannis Manolopoulos, Dimitrios Gunopulos
Article No.: 23
DOI: 10.1145/2847524

Top-k dominating queries combine the natural idea of selecting the k best items with a comprehensive “goodness” criterion based on dominance. A point p1 dominates p2 if...

Section: Invited Papers from PODS 2014

Learning Join Queries from User Examples
Angela Bonifati, Radu Ciucanu, Sławek Staworko
Article No.: 24
DOI: 10.1145/2818637

We investigate the problem of learning join queries from user examples. The user is presented with a set of candidate tuples and is asked to label them as positive or negative examples, depending on whether or not she would like the...

Negative Factor: Improving Regular-Expression Matching in Strings
Xiaochun Yang, Tao Qiu, Bin Wang, Baihua Zheng, Yaoshu Wang, Chen Li
Article No.: 25
DOI: 10.1145/2847525

The problem of finding matches of a regular expression (RE) on a string exists in many applications, such as text editing, biosequence search, and shell commands. Existing techniques first identify candidates using substrings in the RE, then...

Faster Random Walks by Rewiring Online Social Networks On-the-Fly
Zhuojie Zhou, Nan Zhang, Zhiguo Gong, Gautam Das
Article No.: 26
DOI: 10.1145/2847526

Many online social networks feature restrictive web interfaces that only allow the query of a user’s local neighborhood. To enable analytics over such an online social network through its web interface, many recent efforts use Markov Chain...