Ranked enumeration of conjunctive query results

DOI10.46298/LMCS-21(2:14)2025MaRDI QIDQ6960760zbMATH OpenFDO

Authors Shaleen Deep, Paraschos Koutris

Publication date 11 July 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(2:14)2025

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A pseudo-algorithmic separation of lines from pseudo-lines
• An incremental algorithm for computing ranked full disjunctions
• Answering FO+MOD queries under updates on bounded degree databases
• Enumeration algorithms for conjunctive queries with projection
• Finding the k Shortest Paths
• How good is the information theory bound in sorting?
• Introduction to algorithms.
• Necklaces, Convolutions, and X + Y
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Optimal aggregation algorithms for middleware.
• Power of Natural Semijoins
• Size bounds and query plans for relational joins
• Size bounds for factorised representations of query results
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Cited in

(2)

• Enumeration algorithms for conjunctive queries with projection
• Enumeration algorithms for conjunctive queries with projection

This page was built for publication: Ranked enumeration of conjunctive query results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960760)