109 search results - page 18 / 22 » Optimization Using Tuple Subsumption |
VLDB
2004
ACM
14 years 20 days 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...
WAIM
2004
Springer
14 years 20 days ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
EDBTW
2006
Springer
13 years 11 months ago
2006
Springer
Several query languages have been proposed for managing data streams in modern monitoring applications. Continuous queries expressed in these languages usually employ windowing con...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
CIDR
2007
13 years 8 months ago
2007
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...