Sciweavers

101 search results - page 2 / 21
» Efficient Processing of Nested Fuzzy SQL Queries
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 6 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 5 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 5 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
BTW
2003
Springer
170views Database» more  BTW 2003»
13 years 10 months ago
Executing Nested Queries
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
Goetz Graefe
VLDB
1999
ACM
107views Database» more  VLDB 1999»
13 years 9 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe