All Stories

  1. Query Answering without Join Computation: An Interactive Exploration of Practical Techniques
  2. Size Bound-Adorned Datalog
  3. The Space-Time Complexity of Sum-Product Queries
  4. Query Answering Under Volume-Based Diversity Functions
  5. Soft and Constrained Hypertree Width
  6. Convergence of Datalog over (Pre-) Semirings
  7. Efficiently computing graph structures to help answer database queries
  8. Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
  9. Convergence of Datalog over (Pre-) Semirings
  10. Optimizing Recursive Queries with Progam Synthesis
  11. HyperBench
  12. Database Theory Column Report on PODS 2021
  13. On the Language of Nested Tuple Generating Dependencies
  14. HyperBench
  15. Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection
  16. Universities and computer science in the European crisis of refugees
  17. Efficient Evaluation and Approximation of Well-designed Pattern Trees
  18. Function Symbols in Tuple-Generating Dependencies
  19. Containment and equivalence of well-designed SPARQL
  20. Static analysis and optimization of semantic web queries