148 search results - page 3 / 30 » Evaluation of Queries on Tree-Structured Data Using Dimensio... |
KDD
1999
ACM
13 years 12 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
DOLAP
2004
ACM
14 years 1 months ago
2004
ACM
The DWS (Data Warehouse Striping) technique allows the distribution of large data warehouses through a cluster of computers. The data partitioning approach partition the facts tab...
SIGMOD
1997
ACM
13 years 12 months ago
1997
ACM
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...