A time optimized scheme for top-\( k\) list maintenance over incomplete data streams

DOI10.1016/J.INS.2015.03.035zbMath1390.68260OpenAlexW2076293042MaRDI QIDQ1749630

Stathes Hadjiefthymiades, Kostas Kolomvatsos, Christos-Nikolaos Anagnostopoulos

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.03.035

zbMATH Keywords

data streamsoptimal stopping theorytop-\( k\) listtop-\( k\) list maintenance

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Information storage and retrieval of data (68P20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples ⋮ A top-k retrieval algorithm based on a decomposition of ranking functions ⋮ A delay-resilient and quality-aware mechanism over incomplete contextual data streams ⋮ \(k\)-dominant skyline queries on incomplete data ⋮ Effective and efficient top-\(k\) query processing over incomplete data streams

Cites Work

• Optimal aggregation algorithms for middleware.
• Data Stream Management
• Database Theory - ICDT 2005
• Probability and Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A time optimized scheme for top-\( k\) list maintenance over incomplete data streams