default search action
ACM Transactions on Database Systems, Volume 41
Volume 41, Number 1, April 2016
- Christian S. Jensen
:
Editorial: Updates to the Editorial Board. 1e:1
- Leonid Libkin
SQL's Three-Valued Logic and Certain Answers. 1:1-1:28
- Ce Zhang, Arun Kumar, Christopher Ré:
Materialization Optimizations for Feature Selection Workloads. 2:1-2:32
- Dan Olteanu, Sebastiaan J. van Schaik:
ENFrame: A Framework for Processing Probabilistic Data. 3:1-3:44
- Robert Fink, Dan Olteanu:
Dichotomies for Queries with Negation in Probabilistic Databases. 4:1-4:47 - Xiaoling Zhou, Jianbin Qin, Chuan Xiao
BEVA: An Efficient Query Processing Algorithm for Error-Tolerant Autocompletion. 5:1-5:44 - Ronald Fagin, Benny Kimelfeld, Frederick Reiss, Stijn Vansummeren:
Declarative Cleaning of Inconsistencies in Information Extraction. 6:1-6:44 - Huy Pham, Cyrus Shahabi, Yan Liu:
Inferring Social Strength from Spatiotemporal Data. 7:1-7:47
Volume 41, Number 2, June 2016
- Christian S. Jensen
Editorial: The Dark Citations of TODS Papers and What to Do about It - or: Cite the Journal Paper. 8e:1-8e:3
- Alvin Cheung
Sloth: Being Lazy Is a Virtue (When Issuing Database Queries). 8:1-8:42
- Loredana Caruccio
Synchronization of Queries and Views Upon Schema Evolutions: A Survey. 9:1-9:41 - Ting Deng, Wenfei Fan
Capturing Missing Tuples and Missing Values. 10:1-10:47 - Anshuman Dutt
Plan Bouquets: A Fragrant Approach to Robust Query Processing. 11:1-11:37 - Jinhong Jung, Kijung Shin, Lee Sael, U Kang:
Random Walk with Restart on Large Graphs Using Block Elimination. 12:1-12:43 - Marcelo Arenas, Gonzalo I. Diaz
The Exact Complexity of the First-Order Logic Definability Problem. 13:1-13:14 - Sara Cohen
The Complexity of Learning Tree Patterns from Example Graphs. 14:1-14:44
Volume 41, Number 3, August 2016
- Peter Bailis, Alan D. Fekete, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica:
Scalable Atomic Visibility with RAMP Transactions. 15:1-15:45 - Quoc-Cuong To, Benjamin Nguyen
Private and Scalable Execution of SQL Aggregates on a Secure Decentralized Architecture. 16:1-16:43 - Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang-Chiew Tan:
A Declarative Framework for Linking Entities. 17:1-17:38 - Pierre Bourhis, Gabriele Puppis
Bounded Repairability for Regular Tree Languages. 18:1-18:45 - Michael A. Bender, Roozbeh Ebrahimi, Haodong Hu, Bradley C. Kuszmaul:
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys. 19:1-19:33 - Filip Mazowiecki, Filip Murlak
Monadic Datalog and Regular Tree Pattern Queries. 20:1-20:43
Volume 41, Number 4, November 2016
- Yuanyuan Tian
Building a Hybrid Warehouse: Efficient Joins between Data Stored in HDFS and Enterprise Warehouse. 21:1-21:38 - Mahmoud Abo Khamis
Joins via Geometric Resolutions: Worst Case and Beyond. 22:1-22:45
- Dimitra Papadimitriou, Georgia Koutrika, John Mylopoulos, Yannis Velegrakis
The Goal Behind the Action: Toward Goal-Aware Systems and Applications. 23:1-23:43 - Bettina Fazzinga
Exploiting Integrity Constraints for Cleaning Trajectories of RFID-Monitored Objects. 24:1-24:52 - Sofian Maabout, Carlos Ordonez, Patrick Kamnang Wanko, Nicolas Hanusse:
Skycube Materialization Using the Topmost Skyline or Functional Dependencies. 25:1-25:40 - Anton Dignös
Extending the Kernel of a Relational DBMS with Comprehensive Support for Sequenced Temporal Queries. 26:1-26:46 - Pierre Bourhis, Marco Manna
Guarded-Based Disjunctive Tuple-Generating Dependencies. 27:1-27:45
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: