Benchmarking Top-K Keyword and Top-K Document Processing with T^2K^2 and T^2K^2D^2
Truica Ciprian-Octavian UPB, Darmont Jérôme ERIC, Boicea Alexandru UPB, Radulescu Florin UPB
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/cipriantruica/T2K2D2_BenchmarkOfficialIn papernone★ 0
Abstract
Top-k keyword and top-k document extraction are very popular text analysis techniques. Top-k keywords and documents are often computed on-the-fly, but they exploit weighted vocabularies that are costly to build. To compare competing weighting schemes and database implementations, benchmarking is customary. To the best of our knowledge, no benchmark currently addresses these problems. Hence, in this paper, we present T^2K^2, a top-k keywords and documents benchmark, and its decision support-oriented evolution T^2K^2D^2. Both benchmarks feature a real tweet dataset and queries with various complexities and selectivities. They help evaluate weighting schemes and database implementations in terms of computing performance. To illustrate our bench-marks' relevance and genericity, we successfully ran performance tests on the TF-IDF and Okapi BM25 weighting schemes, on one hand, and on different relational (Oracle, PostgreSQL) and document-oriented (MongoDB) database implementations, on the other hand.