Practical Top-K Document Retrieval in Reduced Space

Details Practical Top-K Document Retrieval in Reduced Space Practical Top-K Document Retrieval in Reduced Space

2011-11-18

arxiv.org/abs/1111.4395v1

Computer Science

Data Structures and Algorithms

Scientific paper

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 algorithms and data structures dominate almost all the space/time tradeoff.

Affiliated with

Also associated with

No associations

Rating

Practical Top-K Document Retrieval in Reduced Space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Practical Top-K Document Retrieval in Reduced Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical Top-K Document Retrieval in Reduced Space will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549682