Sciweavers

2635 search results - page 135 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2009
IEEE
122views Database» more  ICDE 2009»
16 years 6 months ago
Best-Effort Top-k Query Processing Under Budgetary Constraints
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
Michal Shmueli-Scheuer, Chen Li, Yosi Mass, Haggai...
UC
2005
Springer
15 years 10 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
CIKM
2008
Springer
15 years 6 months ago
Energy-efficient skyline query processing and maintenance in sensor networks
The skyline query, as an important operator in databases for multi-preference analysis and decision making, has received much attention recently due to its wide application backgr...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu
KDD
1994
ACM
98views Data Mining» more  KDD 1994»
15 years 8 months ago
Rule Induction for Semantic Query Optimization
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn required semantic rules has no...
Chun-Nan Hsu, Craig A. Knoblock
PODC
2009
ACM
15 years 11 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...