242 search results - page 7 / 49 » An Efficient Method for Indexing Now-relative Bitemporal dat... |
DKE
1998
13 years 7 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
DAWAK
1999
Springer
13 years 12 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
BMCBI
2011
12 years 11 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
AI
2006
Springer
13 years 11 months ago
2006
Springer
We focus on clustering gene expression temporal profiles, and propose a novel, simple algorithm that is powerful enough to find an efficient distribution of genes over clusters. We...