Optimal aggregation algorithms for middleware.
From MaRDI portal
Publication:1401963
DOI10.1016/S0022-0000(03)00026-6zbMath1054.68042OpenAlexW2666600683WikidataQ56386817 ScholiaQ56386817MaRDI QIDQ1401963
Moni Naor, Ronald Fagin, Amnon Lotem
Publication date: 19 August 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00026-6
Related Items (35)
A filter-based uniform algorithm for optimizing top-k query in distributed networks ⋮ Finding hidden independent sets in interval graphs ⋮ Approximate distributed top-\(k\) queries ⋮ A faster distributed protocol for constructing a minimum spanning tree ⋮ Approximately dominating representatives ⋮ On the memory requirements of XPath evaluation over XML streams ⋮ Efficiently answering top-k frequent term queries in temporal-categorical range ⋮ Top-\(k\) team synergy problem: capturing team synergy based on C3 ⋮ Unnamed Item ⋮ Supporting early pruning in top-\(k\) query processing on massive data ⋮ A top-k retrieval algorithm based on a decomposition of ranking functions ⋮ Top-\(k\) vectorial aggregation queries in a distributed environment ⋮ Representing and Quantifying Rank - Change for the Web Graph ⋮ Group skyline computation ⋮ Ontological query answering under many-valued group preferences in Datalog\(+/-\) ⋮ OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE ⋮ \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models ⋮ On the semantics of top-\(k\) ranking for objects with uncertain data ⋮ Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models ⋮ A time optimized scheme for top-\( k\) list maintenance over incomplete data streams ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ Optimally adaptive integration of univariate Lipschitz functions ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ Top-\(k\) retrieval for ontology mediated access to relational databases ⋮ Unnamed Item ⋮ Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k -Nearest Neighbor Search ⋮ On the Complexity of Query Result Diversification ⋮ Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces ⋮ Skyline ranking for uncertain databases ⋮ Relational division in rank-aware databases ⋮ Index-based, high-dimensional, cosine threshold querying with optimality guarantees ⋮ Dominant skyline query processing over multiple time series ⋮ Effective and efficient top-\(k\) query processing over incomplete data streams ⋮ Transducing Markov sequences ⋮ Monoidal functional dependencies
Cites Work
This page was built for publication: Optimal aggregation algorithms for middleware.
