Sciweavers

586 search results - page 79 / 118
» Ranking queries on uncertain data
Sort
View
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan
ISMIR
2004
Springer
87views Music» more  ISMIR 2004»
14 years 1 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
2009
Springer
14 years 2 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
CIKM
2007
Springer
14 years 1 months ago
Predictive user click models based on click-through history
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
Benjamin Piwowarski, Hugo Zaragoza
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 2 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell