4081 search results - page 486 / 817 » Metaprogramming for Relational Databases |
169
click to vote
VLDB
2005
ACM
16 years 8 days ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
165
click to vote
DOLAP
2004
ACM
16 years 6 days ago
2004
ACM
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
195
click to vote
SAC
2004
ACM
16 years 6 days ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
154
click to vote
AOSD
2003
ACM
16 years 1 days ago
2003
ACM
Persistence - the storage and retrieval of application data from secondary storage media - is often used as a classical example of a crosscutting concern. It is widely assumed tha...
201
click to vote
DOLAP
2003
ACM
16 years 1 days ago
2003
ACM
Data visualization is one of the big issues of database research. OLAP as a decision support technology is highly related to the developments of data visualization area. In this p...