Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
1 - 5 of 5
-
ItemThe hvtree: A memory hierarchy aware version index(Association for Computing Machinery (ACM), 2010-01-01)The huge amount of temporal data generated from many important applications call for a highly efficient and scalable version index. The TSB-tree has the potential of large scalability due to its unique feature of progressive migration of data to larger mediums. However, its traditional design optimized for two levels of the memory hierarchy (the main memory and the hard disk) undermines its potential for high efficiency in face of today's advances in hardware, especially CPU/cache speed and memory size. We propose a novel version index structure called the HV-tree. Different from all previous version index structures, the HV-tree has nodes of different sizes, each optimized for a level of the memory hierarchy. As data migrates to different levels of the memory hierarchy, the HV-tree will adjust the node size automatically to exploit the best performance of all levels of the memory hierarchy. Moreover, the HV-tree has a unique chain mechanism to maximally keep recent data in higher levels of the memory hierarchy. As a result, HV-tree is several times faster than the TSB-tree for point queries (query with single key and single time value), and up to 1000 times faster than the TSB-tree for key-range and time-range queries.
-
ItemOptimized algorithms for predictive range and KNN queries on moving objects(PERGAMON-ELSEVIER SCIENCE LTD, 2010-12)
-
Item
-
ItemStreaming multiple aggregations using phantoms(SPRINGER, 2010-08)
-
ItemAnalysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries(SPRINGER, 2010-06)