Sciweavers

1031 search results - page 1 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
FGCS
2000
81views more  FGCS 2000»
13 years 5 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
VLDB
1995
ACM
149views Database» more  VLDB 1995»
13 years 8 months ago
Managing Intra-operator Parallelism in Parallel Database Systems
Abstract: Intra-operator(or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exp...
Manish Mehta 0002, David J. DeWitt
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 5 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 8 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
DEXA
2004
Springer
131views Database» more  DEXA 2004»
13 years 10 months ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...