Sciweavers

376 search results - page 30 / 76
» Semantics and Evaluation of Top-k Queries in Probabilistic D...
Sort
View
EDBT
2009
ACM
173views Database» more  EDBT 2009»
14 years 14 days ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
WSMAI
2004
13 years 9 months ago
Scalable Continuous Query System for Web Databases
Continuous Queries (CQ) help users to retrieve results as soon as they become available. The CQ keeps track of two important events. If there is any change in the source informatio...
Ather Saeed, Savitri Bevinakoppa
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
14 years 1 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
ESWS
2011
Springer
12 years 11 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
JANCL
2006
123views more  JANCL 2006»
13 years 7 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas