329 search results - page 40 / 66 » Efficient Parallel Query Processing by Graph Ranking |
IPM
2007
13 years 7 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
IPM
2008
13 years 7 months ago
2008
Document similarity search (i.e. query by example) aims to retrieve a ranked list of documents similar to a query document in a text corpus or on the Web. Most existing approaches...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...