11573 search results - page 216 / 2315 » Designing Relational Databases |
196
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
198
click to vote
CCGRID
2005
IEEE
16 years 5 days ago
2005
IEEE
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
164
click to vote
VLDB
2005
ACM
16 years 23 hour ago
2005
ACM
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
170
click to vote
CLUSTER
2002
IEEE
15 years 11 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...
146
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
This paper examines the properties of metadata in the form of IF THEN rules which contain two predicates on attributes of a relational database table. For example: a(15 .. 30) d(2...