Sciweavers

493 search results - page 17 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 9 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 10 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
14 years 26 days ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin