Sciweavers

333 search results - page 2 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 3 days ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
13 years 9 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
13 years 11 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
15 years 5 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 3 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande