Sciweavers

708 search results - page 61 / 142
» Optimizing SQL Queries over Text Databases
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 10 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
CIDR
2007
100views Algorithms» more  CIDR 2007»
13 years 10 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
PVLDB
2008
126views more  PVLDB 2008»
13 years 8 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 11 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 9 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova