2635 search results - page 88 / 527 » Algorithms for the Database Layout Problem |
133
click to vote
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
We consider the use of a cluster of PC servers for Application Service Providers where applications and databases must remain autonomous. We use data replication to improve data av...
132
click to vote
ADBIS
2009
Springer
15 years 1 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
245
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
134
click to vote
ADBIS
2003
Springer
15 years 9 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
170
click to vote
ICDT
2012
ACM
13 years 6 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...