Sciweavers

30 search results - page 4 / 6
» Performance of compressed inverted list caching in search en...
Sort
View
LAWEB
2005
IEEE
14 years 1 months ago
A Parallel Search Engine with BSP
With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is big...
Veronica Gil Costa, Mauricio Marín
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
CIKM
2009
Springer
14 years 2 months ago
Compact full-text indexing of versioned document collections
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
Jinru He, Hao Yan, Torsten Suel
WWW
2008
ACM
14 years 8 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
14 years 7 months ago
On Supporting Containment Queries in Relational Database Management Systems
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...