ACM Transactions on Database Systems, Volume 40

Volume 40, Number 1, March 2015

• 
  Christian S. Jensen:
  Editorial: Updates to the Editorial Board. 1e:1
• 
  Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer:
  Time- and Space-Efficient Sliding Window Top-k Query Processing. 1:1-1:44
• 
  Dan Olteanu, Jakub Závodný:
  Size Bounds for Factorised Representations of Query Results. 2:1-2:44
• 
  Mateusz Pawlik, Nikolaus Augsten:
  Efficient Computation of the Tree Edit Distance. 3:1-3:40
• 
  Marina Drosou, Evaggelia Pitoura:
  Multiple Radii DisC Diversity: Result Diversification Based on Dissimilarity and Coverage. 4:1-4:43
• 
  Michael Benedikt, Pierre Bourhis, Clemens Ley:
  Analysis of Schemas with Access Restrictions. 5:1-5:46
• 
  Manos Athanassoulis, Shimin Chen, Anastasia Ailamaki, Phillip B. Gibbons, Radu Stoica:
  Online Updates on Data Warehouses via Judicious Use of Solid-State Storage. 6:1-6:42

Volume 40, Number 2, June 2015

Regular Papers

• 
  Christian S. Jensen:
  Editorial: The Best of Two Worlds - Present Your TODS Paper at SIGMOD. 7:1-7:2
• 
  Kaustubh Beedkar, Klaus Berberich, Rainer Gemulla, Iris Miliaraki:
  Closing the Gap: Sequence Mining at Scale. 8:1-8:44
• 
  Tom J. Ameloot:
  Deciding Determinism with Fairness for Simple Transducer Networks. 9:1-9:39
• 
  Mithila Nagendra, K. Selçuk Candan:
  Efficient Processing of Skyline-Join Queries over Multiple Data Sources. 10:1-10:46
• 
  Ganzhao Yuan, Zhenjie Zhang, Marianne Winslett, Xiaokui Xiao, Yin Yang, Zhifeng Hao:
  Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy. 11:1-11:47
• 
  Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett:
  Cost-Effective Conceptual Design for Information Extraction. 12:1-12:39
• 
  Xin Cao, Gao Cong, Tao Guo, Christian S. Jensen, Beng Chin Ooi:
  Efficient Processing of Spatial Group Keyword Queries. 13:1-13:48

Technical Correspondence

• 
  Millist W. Vincent, Jixue Liu, Hong-Cheu Liu, Sebastian Link:
  Technical Correspondence: "Differential Dependencies: Reasoning and Discovery" Revisited. 14:1-14:18

Volume 40, Number 3, October 2015

• 
  Jiaheng Lu, Chunbin Lin, Wei Wang, Chen Li, Xiaokui Xiao:
  Boosting the Quality of Approximate String Matching by Synonyms. 15:1-15:42
• 
  Florin Rusu, Zixuan Zhuang, Mingxi Wu, Chris Jermaine:
  Workload-Driven Antijoin Cardinality Estimation. 16:1-16:41
• 
  Zitong Chen, Yubao Liu, Raymond Chi-Wing Wong, Jiamin Xiong, Ganglin Mai, Cheng Long:
  Optimal Location Queries in Road Networks. 17:1-17:41
• 
  Kristian F. D. Rietveld, Harry A. G. Wijshoff:
  Reducing Layered Database Applications to their Essence through Vertical Integration. 18:1-18:39
• 
  Yu Cheng, Florin Rusu:
  SCANRAW: A Database Meta-Operator for Parallel In-Situ Processing and Loading. 19:1-19:45
• 
  Panos Parchas, Francesco Gullo, Dimitris Papadias, Francesco Bonchi:
  Uncertain Graph Processing through Representative Instances. 20:1-20:39

Volume 40, Number 4, February 2016

Special Section: Invited Papers from PODS 2014

• 
  Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
  Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture. 21:1-21:45
• 
  Michael Benedikt, Balder ten Cate, Efthymia Tsamoura:
  Generating Plans from Proofs. 22:1-22:45

Special Section: Invited Paper from EDBT 2014

• 
  Eleftherios Tiakas, George Valkanas, Apostolos N. Papadopoulos, Yannis Manolopoulos, Dimitrios Gunopulos:
  Processing Top-k Dominating Queries in Metric Spaces. 23:1-23:38

Regular Papers

• 
  Angela Bonifati, Radu Ciucanu, Slawek Staworko:
  Learning Join Queries from User Examples. 24:1-24:38
• 
  Xiaochun Yang, Tao Qiu, Bin Wang, Baihua Zheng, Yaoshu Wang, Chen Li:
  Negative Factor: Improving Regular-Expression Matching in Strings. 25:1-25:46
• 
  Zhuojie Zhou, Nan Zhang, Zhiguo Gong, Gautam Das:
  Faster Random Walks by Rewiring Online Social Networks On-the-Fly. 26:1-26:36