417 search results - page 9 / 84 » Rethinking cost and performance of database systems |
CLUSTER
2002
IEEE
15 years 2 months ago
2002
IEEE
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
DPD
2010
14 years 7 months ago
2010
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
160
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
103
click to vote
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational dat...