Sciweavers

627 search results - page 33 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
16 years 6 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 10 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
RTCSA
2007
IEEE
16 years 8 days ago
A Continuous Query Index for Processing Queries on RFID Data Stream
RFID middleware systems collect and filter RFID streaming data gathered continuously by numerous readers to process requests from applications. These requests are called continuou...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
16 years 7 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su