Efficiently answer top-k queries on typed intervals
作者：
Highlights：
• Top-k queries on typed intervals are defined.
• We build the interval tree in a compact way and propose a partition method.
• Algorithms for non-continuous queries are proposed and the complexity is analyzed.
• Algorithms for continuous queries are developed.
• Extensive experiments using real and synthetic datasets are performed.
摘要
•Top-k queries on typed intervals are defined.•We build the interval tree in a compact way and propose a partition method.•Algorithms for non-continuous queries are proposed and the complexity is analyzed.•Algorithms for continuous queries are developed.•Extensive experiments using real and synthetic datasets are performed.
论文关键词：
论文评审过程：Received 27 April 2016, Revised 7 April 2017, Accepted 15 August 2017, Available online 19 August 2017, Version of Record 29 August 2017.
论文官网地址：https://doi.org/10.1016/j.is.2017.08.005
