2635 search results - page 243 / 527 » Algorithms for the Database Layout Problem |
213
click to vote
SPIRE
2005
Springer
16 years 2 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
190
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
282
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
280
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
214
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...