TopX & XXL at INEX 2005
Martin Theobald, Ralf Schenkel, Gerhard Weikum · 2005
Abstract. We participated with two different and independent search engines in this year’s INEX round: The XXL Search Engine and the TopX engine. As this is the first participation for TopX, this paper focuses on the design principles, scoring, query evaluation and results of TopX. We shortly discuss the results with XXL afterwards. 1 TopX – System overview Our query processing methods are based on precomputed index lists that are sorted in descending order of appropriately defined scores for individual tagterm content conditions, and our algorithmic rationale for top-k queries follows that of the family of threshold algorithms (TA) [2, 4, 5]. In order to find the top-k matches for multidimensional queries (e.g., with multiple content and structure conditions), scoring, and ranking them, TopX scans all relevant index lists in an interleaved manner. In each scan step, when the engine sees the score for a data item in one list, it combines this score with scores for the same data item previously seen in other index lists into a global score using a monotonic aggregation