Any-k Algorithms for Exploratory Analysis with Conjunctive Queries.

Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.) Pub Date : 2018-06-01 DOI:10.1145/3214708.3214711

Xiaofeng Yang, Mirek Riedewald, Rundong Li, Wolfgang Gatterbauer

{"title":"Any-k Algorithms for Exploratory Analysis with Conjunctive Queries.","authors":"Xiaofeng Yang, Mirek Riedewald, Rundong Li, Wolfgang Gatterbauer","doi":"10.1145/3214708.3214711","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3214708.3214711","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3214708.3214711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

Abstract

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.

Abstract Image

查看原文本刊更多论文

带有联合查询的探索性分析的Any-k算法。

我们最近提出了任意k查询的概念，以及KARPET算法，用于标记图中的树模式搜索。Any-k通过不需要预先指定的k值来扩展top-k。相反，对于给定的时间预算，Any-k算法返回尽可能多的排名靠前的结果。如果有额外的时间，它也会很快产生排名第二的结果。它可以随时停止，但可能必须继续，直到返回所有结果。在后一种情况下，any-k所花费的时间类似于首先生成所有结果然后对它们进行排序的算法。我们总结了KARPET，并认为它可以扩展到支持任意连接查询的任意k探索性搜索。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)

自引率

0.00%

发文量