文章基本信息

标题：Path Queries on Functions
本地全文：下载
作者：Travis Gagie ; Meng He ; Gonzalo Navarro 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：78
页码：5:1-5:15
DOI：10.4230/LIPIcs.CPM.2017.5
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Let f : [1..n] -> [1..n] be a function, and l : [1..n] -> [1..s] indicate a label assigned to each element of the domain. We design several compact data structures that answer various queries on the labels of paths in f. For example, we can find the minimum label in f^k (i) for a given i and any k >= 0 in a given range [k1..k2], using n lg n + O(n) bits, or the minimum label in f^(-k) (i) for a given i and k > 0, using 2n lg n + O(n) bits, both in time O(lg n/ lg lg n). By using n lg s + o(n lg s) further bits, we can also count, within the same time, the number of elements within a range of labels, and report each such element in O(1 + lg s / lg lg n) additional time. Several other possible queries are considered, such as top-t queries and t-majorities.
关键词：succinct data structures; integer functions; range queries; trees and permutations