In data warehouses measures are analyzed along different dimensions. Although the structures of these dimensions change over time, data warehouse tools currently in use are not ab...
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Background: It is well known that most of the binding free energy of protein interaction is contributed by a few key hot spot residues. These residues are crucial for understandin...
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...