1 Hit in 3.8 sec

Aggregations over Generalized Hypertree Decompositions [article]

Manas Joglekar, Rohan Puttagunta, Christopher Ré
<span title="2015-12-10">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The second class of our contributions is a pair of complete characterizations of (1) the set of orderings equivalent to a given ordering and (2) the set of GHDs compatible with some equivalent ordering  ...  Our extensions to the standard techniques are a pair of simple tests that (1) determine if two orderings of aggregation operators are equivalent and (2) determine if a GHD is compatible with a given ordering  ...  Fun with semirings: A functional pearl on the abuse of linear algebra. Recall E C = {E ∈ E|E ∩ C = ∅}.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1508.07532v4</a> <a target="_blank" rel="external noopener" href="">fatcat:wcfrzzftcbdp5g6dgi7uqfzsyi</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>