Abstract is missing.
- Databases as Graphs: Predictive Queries for Declarative Machine LearningJure Leskovec. 1 [doi]
- The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023Marcelo Arenas, Wenfei Fan, Frank Neven. 3-4 [doi]
- Applications of Sketching and Pathways to ImpactGraham Cormode. 5-10 [doi]
- SQL Nulls and Two-Valued LogicLeonid Libkin, Liat Peterfreund. 11-20 [doi]
- Generative Datalog with Stable NegationMario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris. 21-32 [doi]
- Synthesizing Nested Relational Queries from Implicit SpecificationsMichael Benedikt, Cécilia Pradic, Christoph Wernhard. 33-45 [doi]
- Distributed Consistency Beyond QueriesTim Baccaert, Bas Ketsman. 47-58 [doi]
- Space-Time Tradeoffs for Conjunctive Queries with Access PatternsHangdong Zhao, Shaleen Deep, Paraschos Koutris. 59-68 [doi]
- Allocating Isolation Levels to Transactions in a Multiversion SettingBrecht Vandevoort, Bas Ketsman, Frank Neven. 69-78 [doi]
- Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries SketchChristian Janos Lebeda, Jakub Tetek. 79-88 [doi]
- Extremal Fitting Problems for Conjunctive QueriesBalder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz. 89-98 [doi]
- On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join AlgorithmsShiyuan Deng, Shangqi Lu, Yufei Tao 0001. 99-111 [doi]
- Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over JoinsKyoungmin Kim, Jaehyun Ha, George Fletcher 0001, Wook-Shin Han. 113-125 [doi]
- Set Cover in the One-pass Edge-arrival Streaming ModelSanjeev Khanna, Christian Konrad 0001, Cezar-Mihail Alexandru. 127-139 [doi]
- Coloring in Graph Streams via Deterministic and Adversarially Robust AlgorithmsSepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl. 141-153 [doi]
- Towards Better Bounds for Finding Quasi-IdentifiersRyan Hildebrant, Quoc-Tung Le, Duy Hoang Ta, Hoa T. Vu. 155-167 [doi]
- Weighted Minwise Hashing Beats Linear Sketching for Inner Product EstimationAline Bessa, Majid Daliri, Juliana Freire, Cameron Musco, Christopher Musco, Aécio S. R. Santos, Haoxiang Zhang. 169-181 [doi]
- Node-Differentially Private Estimation of the Number of Connected ComponentsIden Kalemaj, Sofya Raskhodnikova, Adam D. Smith, Charalampos E. Tsourakakis. 183-194 [doi]
- Universal Private EstimatorsWei Dong, Ke Yi. 195-206 [doi]
- Differentially Private Data Release over Multiple TablesBadih Ghazi, Xiao Hu, Ravi Kumar 0001, Pasin Manurangsi. 207-219 [doi]
- Optimal Uncoordinated Unique IDsPeter C. Dillinger, Martin Farach-Colton, Guido Tagliavini, Stefan Walzer. 221-230 [doi]
- Conjunctive Regular Path Queries under Injective SemanticsDiego Figueira, Miguel Romero 0001. 231-240 [doi]
- GPC: A Pattern Calculus for Property GraphsNadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc. 241-250 [doi]
- Static Analysis of Graph Database TransformationsIovka Boneva, Benoît Groz, Jan Hidders, Filip Murlak, Slawek Staworko. 251-261 [doi]
- Indexing for Keyword Search with Structured ConstraintsShangqi Lu, Yufei Tao 0001. 263-275 [doi]
- Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity AnalysisNofar Carmeli, Luc Segoufin. 277-289 [doi]
- Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable QueryingJean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph. 291-302 [doi]
- Efficient Computation of Quantiles over JoinsNikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer, Benny Kimelfeld, Mirek Riedewald. 303-315 [doi]
- Better Cardinality Estimators for HyperLogLog, PCSA, and BeyondDingyu Wang, Seth Pettie. 317-327 [doi]
- Quantifying the Loss of Acyclic Join DependenciesBatya Kenig, Nir Weinberger. 329-338 [doi]
- Probabilistic Query Evaluation: The Combined FPRAS LandscapeTimothy van Bremen, Kuldeep S. Meel. 339-347 [doi]
- Querying Incomplete Numerical Data: Between Certain and Possibile AnswersMarco Console, Leonid Libkin, Liat Peterfreund. 349-358 [doi]
- Corrigendum: Are Few Bins Enough: Testing Histogram DistributionsClément L. Canonne. 359 [doi]
- Sampling Big Ideas in Query OptimizationEdith Cohen. 361-371 [doi]
- A Query Language Perspective on Graph LearningFloris Geerts. 373-379 [doi]