Cargando…
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on labeled graphs (also called “heterogeneous information networks” or HINs). Given a large graph and a query pattern with node...
Autores principales: | Yang, Xiaofeng, Nicholson, Patrick K., Ajwani, Deepak, Riedewald, Mirek, Gatterbauer, Wolfgang, Sala, Alessandra |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6037532/ https://www.ncbi.nlm.nih.gov/pubmed/30003197 http://dx.doi.org/10.1145/3178876.3186115 |
Ejemplares similares
-
Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries
por: Tziavelis, Nikolaos, et al.
Publicado: (2020) -
Beyond Equi-joins: Ranking, Enumeration and Factorization
por: Tziavelis, Nikolaos, et al.
Publicado: (2021) -
Anytime Coaching
por: Kloster, Teresa
Publicado: (2015) -
Your perfect presentation: speak in front of any audience anytime anywhere and never be nervous again
por: Hoogterp, Bill
Publicado: (2014) -
Graph limits of random graphs from a subset of connected k‐trees
por: Drmota, Michael, et al.
Publicado: (2018)