Sciweavers

176 search results - page 13 / 36
» Supporting ranking queries on uncertain and incomplete data
Sort
View
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 8 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
CIKM
2010
Springer
13 years 5 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 1 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
SEMWEB
2010
Springer
13 years 5 months ago
Linked Data Query Processing Strategies
Abstract. Recently, processing of queries on linked data has gained attention. We identify and systematically discuss three main strategies: a bottom-up strategy that discovers new...
Günter Ladwig, Thanh Tran