Any-k Algorithms for Exploratory Analysis with Conjunctive Queries
| Autor: | Rundong Li, Xiaofeng Yang, Mirek Riedewald, Wolfgang Gatterbauer |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Computer science
Value (computer science) Exploratory search 0102 computer and information sciences 02 engineering and technology Exploratory analysis 01 natural sciences Graph Article Ranking 010201 computation theory & mathematics 020204 information systems 0202 electrical engineering electronic engineering information engineering Conjunctive query Algorithm |
| Zdroj: | Proc 5th Int Workshop Explor Search Databases Web (2018) ExploreDB@SIGMOD/PODS |
| Popis: | We recently proposed the notion of any-k queries, together with the KARPET algorithm, for tree-pattern search in labeled graphs. Any-k extends top-k by not requiring a pre-specified value of k. Instead, an any-k algorithm returns as many of the top-ranked results as possible, for a given time budget. Given additional time, it produces the next-highest ranked results quickly as well. It can be stopped anytime, but may have to continue until all results are returned. In the latter case, any-k takes times similar to an algorithm that first produces all results and then sorts them. We summarize KARPET and argue that it can be extended to support any-k exploratory search for arbitrary conjunctive queries. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|