Sciweavers

2778 search results - page 439 / 556
» Limit complexities revisited
Sort
View
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
16 years 6 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 6 months ago
Data exchange and schema mappings in open and closed worlds
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...
Leonid Libkin, Cristina Sirangelo
ICSE
2003
IEEE-ACM
16 years 6 months ago
Patterns, Frameworks, and Middleware: Their Synergistic Relationships
The knowledge required to develop complex software has historically existed in programming folklore, the heads of experienced developers, or buried deep in the code. These locatio...
Douglas C. Schmidt, Frank Buschmann
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...