Sciweavers

493 search results - page 71 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ICDT
2009
ACM
135views Database» more  ICDT 2009»
16 years 29 days ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
AAAI
1998
15 years 7 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
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
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 7 months ago
Scoop: An Adaptive Indexing Scheme for Stored Data in Sensor Networks
We present the design of Scoop, a system for indexing and querying stored data in sensor networks. Scoop works by collecting statistics about the rate of queries and distribution ...
Thomer M. Gil, Samuel Madden
ICDE
2005
IEEE
180views Database» more  ICDE 2005»
16 years 7 months ago
A Unified Framework for Monitoring Data Streams in Real Time
Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, webclick st...
Ahmet Bulut, Ambuj K. Singh