Sciweavers

6905 search results - page 1025 / 1381
» Querying Multidimensional Databases
Sort
View
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 4 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 4 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 11 months ago
Supporting annotations on relations
Annotations play a key role in understanding and curating databases. Annotations may represent comments, descriptions, lineage information, among several others. Annotation manage...
Mohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmag...
136
Voted
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 11 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
15 years 10 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
« Prev « First page 1025 / 1381 Last » Next »