Sciweavers

493 search results - page 5 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ASUNAM
2011
IEEE
12 years 7 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 2 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
VLDB
2005
ACM
105views Database» more  VLDB 2005»
14 years 25 days ago
Answering Imprecise Queries over Web Databases
Ullas Nambiar, Subbarao Kambhampati
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande