Ładuje się......
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes seemingly different problems that had been studied in isolation. T...
Zapisane w:
| Wydane w: | Proceedings VLDB Endowment |
|---|---|
| Główni autorzy: | , , , , |
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
2020
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7955775/ https://ncbi.nlm.nih.gov/pubmed/33717631 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.14778/3397230.3397250 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|