Sciweavers

386 search results - page 17 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
14 years 10 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 9 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 3 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
PODS
2007
ACM
139views Database» more  PODS 2007»
14 years 9 months ago
Management of probabilistic data: foundations and challenges
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
Nilesh N. Dalvi, Dan Suciu
VLDB
2004
ACM
138views Database» more  VLDB 2004»
14 years 2 months ago
ObjectRank: Authority-Based Keyword Search in Databases
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
Andrey Balmin, Vagelis Hristidis, Yannis Papakonst...