We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
Abstract. We describe a method for computing a continuous time estimate of dynamic changes in tracer density using list mode PET data. The tracer density in each voxel is modeled a...
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...