Sciweavers

1937 search results - page 5 / 388
» Conditioning Probabilistic Databases
Sort
View
SIGMOD
2005
ACM
88views Database» more  SIGMOD 2005»
14 years 11 months ago
Foundations of probabilistic answers to queries
Dan Suciu, Nilesh N. Dalvi
PODS
2007
ACM
113views Database» more  PODS 2007»
14 years 11 months ago
Maximally joining probabilistic data
Benny Kimelfeld, Yehoshua Sagiv
SCCC
1997
IEEE
14 years 3 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
PVLDB
2010
98views more  PVLDB 2010»
13 years 9 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 5 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin