Approximate Continuous Top-k Query over Sliding Window
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Computer Science and Technology"
DOI: 10.1007/s11390-017-1708-0
Abstract: Continuous top-k query over sliding window is a fundamental problem in database, which retrieves k objects with the highest scores when the window slides. Existing studies mainly adopt exact algorithms to tackle this type of… read more here.
Keywords: approximate continuous; query; continuous top; top query ... See more keywords