Sciweavers

2635 search results - page 79 / 527
» Algorithms for the Database Layout Problem
Sort
View
VLDB
2007
ACM
144views Database» more  VLDB 2007»
16 years 4 months ago
Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS
This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling policies...
Marcin Zukowski, Sándor Héman, Niels...
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
15 years 10 months ago
Design closure driven delay relaxation based on convex cost network flow
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
Chuan Lin, Aiguo Xie, Hai Zhou
GD
2006
Springer
15 years 7 months ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
MFDBS
1989
102views Database» more  MFDBS 1989»
15 years 8 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 10 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...