default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th PODS 2018: Houston, TX, USA
- Jan Van den Bussche, Marcelo Arenas:
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018. ACM 2018
Keynote Talk
- Michael Benedikt:
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)? 1-15
Graphs and Hypergraphs Techniques on Databases
- Wolfgang Fischl, Georg Gottlob, Reinhard Pichler:
General and Fractional Hypertree Decompositions: Hard and Easy Cases. 17-32 - Michael Mitzenmacher, Tom Morgan:
Reconciling Graphs and Sets of Sets. 33-47
Best Paper Award, Similarity Search and Clustering
- Yufei Tao
:
Entity Matching with Active Monotone Classification. 49-62 - Samuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh:
Set Similarity Search for Skewed Data. 63-74 - Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan, Erin Taylor:
Subtrajectory Clustering: Models and Algorithms. 75-87 - Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri:
Distance-Sensitive Hashing. 89-104
Test-of-Time Award and Gems of pods
- Maurizio Lenzerini, Wim Martens, Nicole Schweikardt:
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award. 105 - Phokion G. Kolaitis:
Reflections on Schema Mappings, Data Exchange, and Metadata Management. 107-109 - Hung Q. Ngo:
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. 111-124
Information Extraction and Efficient Enumeration of Answers
- Francisco Maturana, Cristian Riveros, Domagoj Vrgoc:
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity. 125-136 - Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund:
Joining Extractions of Regular Expressions. 137-149 - Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. 151-163 - Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Domagoj Vrgoc:
Constant Delay Algorithms for Regular Document Spanners. 165-177 - Matthias Niewerth, Luc Segoufin:
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. 179-191
Invited Tutorial 1
- Arvind Narayanan:
Blockchains: Past, Present, and Future. 193
Consistent Query Answering, Certain Answers and Repairs
- Leonid Libkin:
Certain Answers Meet Zero-One Laws. 195-207 - Paraschos Koutris, Jef Wijsen:
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms. 209-224 - Ester Livshits, Benny Kimelfeld, Sudeepa Roy:
Computing Optimal Repairs for Functional Dependencies. 225-237 - Marco Calautti, Leonid Libkin, Andreas Pieris:
An Operational Approach to Consistent Query Answering. 239-251
Query Evaluation and Containment
- Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. 253-266 - Pablo Barceló, Gerald Berger, Andreas Pieris:
Containment for Rule-Based Ontology-Mediated Queries. 267-279 - Antoine Amarilli, Michael Benedikt:
When Can We Answer Queries Using Result-Bounded Data Interfaces? 281-293 - Miguel Romero:
The Tractability Frontier of Well-designed SPARQL Queries. 295-306 - Shaleen Deep, Paraschos Koutris:
Compressed Representations of Conjunctive Query Results. 307-322
Invited Tutorial 2
- Rajeev Raman:
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract. 323-324
Learning and Streaming
- Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. 325-340 - Rajesh Jayaram, David P. Woodruff:
Data Streams with Bounded Deletions. 341-354 - Balder ten Cate, Phokion G. Kolaitis, Kun Qian, Wang-Chiew Tan:
Active Learning of GAV Schema Mappings. 355-368 - Jiecao Chen, Qin Zhang:
Distinct Sampling on Streaming Data with Near-Duplicates. 369-382
Algorithms, Privacy and Workflows
- David P. Woodruff, Qin Zhang:
Distributed Statistical Estimation of Matrix Products with Applications. 383-394 - Zhiyi Huang, Jinyan Liu:
Optimal Differentially Private Algorithms for k-Means Clustering. 395-408 - Serge Abiteboul, Pierre Bourhis, Victor Vianu:
Explanations and Transparency in Collaborative Workflows. 409-424 - Sharareh Alipour, Amir Jafari:
Improvements on the k-center Problem for Uncertain Data. 425-433 - Mark Bun, Jelani Nelson, Uri Stemmer:
Heavy Hitters and the Structure of Local Privacy. 435-447
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-11-04 20:52 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:
