Cargando…
Beyond Equi-joins: Ranking, Enumeration and Factorization
We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities in particular, focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our approach achieves strong time and space complexity p...
Autores principales: | Tziavelis, Nikolaos, Gatterbauer, Wolfgang, Riedewald, Mirek |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9106312/ https://www.ncbi.nlm.nih.gov/pubmed/35573749 http://dx.doi.org/10.14778/3476249.3476306 |
Ejemplares similares
-
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
por: Tziavelis, Nikolaos, et al.
Publicado: (2020) -
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
por: Yang, Xiaofeng, et al.
Publicado: (2018) -
Circulating Tumor Cells, Enumeration and Beyond
por: Hou, Jian-Mei, et al.
Publicado: (2010) -
Red blood cells join the ranks as immune sentinels
por: Minton, Kirsty
Publicado: (2021) -
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
por: Azam, Naveed Ahmed, et al.
Publicado: (2020)