Sciweavers

6153 search results - page 947 / 1231
» Modeling Cyclic Change
Sort
View
OSDI
2002
ACM
16 years 7 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin
VLDB
2007
ACM
225views Database» more  VLDB 2007»
16 years 6 months ago
An Approach to Optimize Data Processing in Business Processes
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
Marko Vrhovnik, Holger Schwarz, Oliver Suhre, Bern...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
16 years 6 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin
SIGMOD
2004
ACM
142views Database» more  SIGMOD 2004»
16 years 6 months ago
Conditional Selectivity for Statistics on Query Expressions
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...
Nicolas Bruno, Surajit Chaudhuri