2446 search results - page 429 / 490 » First Smart Spaces |
341
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
127
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
164
click to vote
PODS
2005
ACM
16 years 3 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
137
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
134
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...