Sciweavers

105 search results - page 20 / 21
» Probabilistic ranked queries in uncertain databases
Sort
View
VLDB
2002
ACM
131views Database» more  VLDB 2002»
13 years 5 months ago
ProTDB: Probabilistic Data in XML
Whereas traditional databases manage only deterministic information, many applications that use databases involve uncertain data. This paper presents a Probabilistic Tree Data Bas...
Andrew Nierman, H. V. Jagadish
CIKM
2011
Springer
12 years 5 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
BMCBI
2006
195views more  BMCBI 2006»
13 years 5 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 5 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
13 years 8 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu