611 search results - page 24 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
ICDE
2002
IEEE
14 years 19 days ago
2002
IEEE
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
FQAS
2006
Springer
13 years 11 months ago
2006
Springer
We present a functional model for the analysis of large volumes of detailed transactional data, accumulated over time. In our model, the data schema is an acyclic graph with a sing...
GD
2004
Springer
14 years 1 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
IPL
2007
13 years 7 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...