Sciweavers

101 search results - page 6 / 21
» Query optimization techniques for partitioned tables
Sort
View
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 9 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
JDWM
2006
178views more  JDWM 2006»
13 years 7 months ago
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining ta...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
ICDT
2007
ACM
105views Database» more  ICDT 2007»
14 years 1 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...