This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
With the rapid growth of biomedical research databases, opportunities for scientific inquiry have expanded quickly and led to a demand for computational methods that can extract b...
Mohammed I. Rafiq, Martin J. O'Connor, Amar K. Das
Recent years have witnessed a rapidly growing interest in query processing in sensor and actuator networks. This is mainly due to the increased awareness of query processing as th...
Michael Zoumboulakis, George Roussos, Alexandra Po...
This paper presents our experiments on TRECVID workshop 2008. This year we participated in two challenging tasks, rushes video summarisation and video copy detection tasks. We stu...