Efficiently answer top-k queries on typed intervals
Authors:
- Jianqiu XuJXJianqiu Xu
- Hua LuHLHua Lu
- 1 November 2017
- journal article
- Published by Elsevier in Information Systems
- Vol. 71, 164-181
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Binary Interval Search: a scalable algorithm for counting interval intersectionsBioinformatics, 2012
- Join operations in temporal databasesThe VLDB Journal, 2005
- Incremental computation and maintenance of temporal aggregatesThe VLDB Journal, 2003
- Optimal External Memory Interval ManagementSIAM Journal on Computing, 2003
- Indexing for Data Models with Constraints and ClassesJournal of Computer and System Sciences, 1996
- Selection predicate indexing for active databases using interval skip listsInformation Systems, 1996
- The Snapshot Index: An I/O-Optimal access method for timeslice queriesInformation Systems, 1995
- The interval B-treeInformation Processing Letters, 1995
- External segment treesAlgorithmica, 1994
- Priority Search TreesSIAM Journal on Computing, 1985