All Stories

  1. Query Answering Under Volume-Based Diversity Functions
  2. MillenniumDB: A Multi-modal, Multi-model Graph Database
  3. The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023
  4. #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
  5. The Complexity of Counting Problems Over Incomplete Databases
  6. A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)
  7. When is approximate counting for conjunctive queries tractable?
  8. Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
  9. Counting Problems over Incomplete Databases
  10. Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
  11. Expressive Languages for Querying the Semantic Web
  12. G-CORE
  13. A survey of modern languages for querying graphs databases
  14. The Exact Complexity of the First-Order Logic Definability Problem
  15. 2016 ACM PODS Alberto O. Mendelzon Test-of-Time Award
  16. Designing a Query Language for RDF
  17. Reverse Engineering SPARQL Queries
  18. Faceted Search over Ontology-Enhanced RDF Data
  19. Expressive languages for querying the semantic web
  20. Towards semantic faceted search
  21. SemFacet
  22. Data exchange beyond complete data
  23. On directly mapping relational databases to RDF and OWL
  24. Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
  25. Data exchange beyond complete data
  26. Querying semantic web data with SPARQL