735 search results - page 75 / 147 » Query Optimization In Compressed Database Systems |
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
SIGMOD
1996
ACM
14 years 1 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
SSDBM
1999
IEEE
14 years 1 months ago
1999
IEEE
In many scientific domains, experimental devices or simulation programs generate large volumes of data. The volumes of data may reach hundreds of terabytes and therefore it is imp...
ICDE
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...