Sciweavers

322 search results - page 26 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
QUESTA
2010
112views more  QUESTA 2010»
13 years 7 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 8 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
P2P
2006
IEEE
101views Communications» more  P2P 2006»
14 years 2 months ago
Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query r...
Cong Shi, Shicong Meng, Yuanjie Liu, Dingyi Han, Y...
ICDCS
2009
IEEE
14 years 5 months ago
Autonomous Resource Selection for Decentralized Utility Computing
Many large-scale utility computing infrastructures comprise heterogeneous hardware and software resources. This raises the need for scalable resource selection services, which ide...
Paolo Costa, Jeff Napper, Guillaume Pierre, Maarte...