Optimal Aggregation Algorithms for Middleware
Ron Fagin, Amnon Lotem, Moni Naor
Abstract
Let D be a database of N objects where each object has m fields. The objects are given in m sorted lists (where the ith list is sorted according to the ith field). Our goal is to find the top k objects according to a monotone aggregation function t, while minimizing access to the lists. The problem arises in several contexts. In particular Fagin (JCSS 1999) considered it for the purpose of aggregating information in a multimedia database system. We are interested in instance optimality, i.e. that our algorithm will be as good as any other (correct) algorithm on any instance. We provide and analyze several instance optimal algorithms for the task, with various access costs and models.
Create a lesson
Related papers
Knowledge Graph Lakehouse: A Cloud-Native Architecture for Managing Enterprise Knowledge Graphs at Scale
Bashar Ahmad, Christoph G. Schuetz, Loris Bozzato
ZeroGR: Filtering-First Constrained Decoding for Generative Recommendation
Xiangrui Yang, Jiawei Yang, Liang Zeng et al.
Order-Dependent Complexity of Enumeration and Direct Access for Conjunctive Queries on Dynamic Data
Antoine Amarilli, Nofar Carmeli, Clémence Dumoulin
Text-to-SQL Models Make Choices Without Saying So
Yichen Xu, Shipei Lin, Chenhao Ma
Navigating Runtime Dynamism in Semantic Query Serving
Hengrui Zhang, Xupeng Miao
SQLoom: Set-Contrastive Learning of Syntactic, Semantic, and Logical Dependencies for Text-to-SQL
Hao Fu, Degang Sun, Wan Wei et al.