Name
Abstract | ||
|---|---|---|
Supporting top-k document retrieval queries on general text databases, that is, finding the k documents where a given pattern occurs most frequently, has become a topic of interest with practical applications. While the problem has been solved in optimal time and linear space, the actual space usage is a serious concern. In this paper we study various reduced-space structures that support top-k retrieval and propose new alternatives. Our experimental results show that our novel structures and algorithms dominate almost all the space/time tradeoff. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-30850-5_27 | SEA |
Keywords | Field | DocType |
top-k document retrieval query,k document,time tradeoff,new alternative,space-efficient top-k document retrieval,top-k retrieval,general text databases,optimal time,actual space usage,linear space | Inverted index,Data mining,Information retrieval,Computer science,Linear space,Wavelet Tree,Document retrieval | Conference |
Citations | PageRank | References |
17 | 0.61 | 22 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gonzalo Navarro | 1 | 6088 | 345.16 |
| Daniel Valenzuela | 2 | 35 | 6.65 |