Sciweavers

958 search results - page 19 / 192
» The Time Index: An Access Structure for Temporal Data
Sort
View
CAISE
2003
Springer
14 years 1 months ago
A Bi-Temporal Data Warehouse Model
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...
Christian Koncilia
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 1 months ago
Compression, Indexing, and Retrieval for Massive String Data
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...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
BMCBI
2010
190views more  BMCBI 2010»
13 years 8 months ago
APIS: accurate prediction of hot spots in protein interfaces by combining protrusion index with solvent accessibility
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...
Jun-Feng Xia, Xing-Ming Zhao, Jiangning Song, De-S...
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 9 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
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...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 9 months ago
Efficient Temporal Join Processing Using Indices
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...