Sciweavers

386 search results - page 26 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
14 years 2 months ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
14 years 1 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 9 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
ISMIR
2004
Springer
87views Music» more  ISMIR 2004»
14 years 2 months ago
Search Effectiveness Measures for Symbolic Music Queries in Very Large Databases
In the interest of establishing robust benchmarks for search efficiency, we conducted a series of tests on symbolic databases of musical incipits and themes taken from several di...
Craig Stuart Sapp, Yi-Wen Liu, Eleanor Selfridge-F...
CIKM
2007
Springer
14 years 3 months ago
Query expansion using probabilistic local feedback with application to multimedia retrieval
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
Rong Yan, Alexander G. Hauptmann