627 search results - page 115 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
DEXAW
1999
IEEE
15 years 1 months ago
1999
IEEE
The design of efficient textual similarities is an important issue in the domain of textual data exploration. Textual similarities are for example central in document collection s...
81
Voted
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
WEBDB
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
116
click to vote
FAST
2004
14 years 11 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
GRID
2008
Springer
14 years 9 months ago
2008
Springer
The existence of good probabilistic models for the job arrival process and the delay components introduced at different stages of job processing in a Grid environment is important ...