Sciweavers

2514 search results - page 183 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 11 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
IPPS
1998
IEEE
15 years 10 months ago
High Performance Data Mining Using Data Cubes on Parallel Computers
On-Line Analytical Processing techniques are used for data analysis and decision support systems. The multidimensionality of the underlying data is well represented by multidimens...
Sanjay Goil, Alok N. Choudhary
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 10 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
STACS
2001
Springer
15 years 11 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
VLDB
2006
ACM
190views Database» more  VLDB 2006»
16 years 6 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu