TopX: Efficient and versatile top-k query processing for semistructured data (2008)
Martin Theobald, Holger Bast, Debapriyo Majumdar, Ralf Schenkel Gerhard, Martin Theobald, Holger Bast, ...
Abstract Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI query language of the INEX benchmark series reflect the emerging interest in IR-style ranked retrieval...
TopX: Efficient and Versatile Top-k Query Processing for Semistructured Data (2008)
Theobald, Martin, Bast, Holger, Majumdar, Debapriyo, Schenkel, Ralf, Weikum, Gerhard
Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI query language of the INEX benchmark series reflect the emerging interest in IR-style ranked retrieval over...
Efficient interactive query expansion with CompleteSearch (2007)
Bast, Holger, Majumdar, Debapriyo, Weber, Ingmar
We present an efficient realization of the following interactive search engine feature: as the user is typing the query, words that are related to the last query word and that would lead to good hits...
Discovering a term taxonomy from term similarities using principal component analysis (2006)
Holger Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski
Abstract. We show that eigenvector decomposition can be used to extract a term taxonomy from a given collection of text documents. So far, methods based on eigenvector decomposition, such as latent...
Io-top-k: Index-access optimized top-k query processing (2006)
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum
Top-k query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data. Top-k...
Sequences characterizing k-trees (2006)
Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber
Abstract. A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) on n vertices if and only if there are least two 1’s in the sequence, and the sum of...
Io-top-k: Index-access optimized top-k query processing (2006)
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum
Top-k query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data. Top-k...
Io-top-k: Index-access optimized top-k query processing (2006)
Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum
Top-k query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data. Top-k...
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis (2006)
Bast, Holger, Dupret, Georges, Majumdar, Debapriyo, Piwowarski, Benjamin, Ackermann, Markus, Berendt, Bettina, ...
We show that eigenvector decomposition can be used to extract a term taxonomy from a given collection of text documents. So far, methods based on eigenvector decomposition, such as latent semantic...
IO-Top-k: Index-Access Optimized Top-k Query Processing (2006)
Bast, Holger, Majumdar, Debapriyo, Schenkel, Ralf, Theobald, Martin, Weikum, Gerhard, Dayal, Umeshwar, ...
Top-$k$ query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data....
IO-Top-k at TREC 2006: Terabyte Track (2006)
Bast, Holger, Majumdar, Debapriyo, Schenkel, Ralf, Theobald, Martin, Weikum, Gerhard, Voorhees, Ellen M., ...
Sequences Characterizing k-Trees (2006)
Lotker, Zvi, Majumdar, Debapriyo, Narayanaswamy, N.S., Weber, Ingmar, Chen, Danny Z., Lee, D. T.
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) on n vertices if and only if there are least two 1’s in the sequence, and the sum of the elements...
IO-Top-k: Index-access Optimized Top-k Query Processing (2006)
Bast, Holger, Majumdar, Debapriyo, Schenkel, Ralf, Theobald, Martin, Weikum, Gerhard, Dayal, Umeshwar, ...
Top-$k$ query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data....
IO-Top-k at TREC 2006: Terabyte Track (2006)
Bast, Holger, Majumdar, Debapriyo, Schenkel, Ralf, Theobald, Martin, Weikum, Gerhard, Voorhees, Ellen M., ...
This paper describes the setup and results of our contribution to the TREC 2006 Terabyte Track. Our implementation was based on the algorithms proposed in [IO-Top-k: Index-Access Optimized Top-K...
Why Spectral Retrieval Works (2005)
Bast, Holger, Majumdar, Debapriyo, Marchionini, Gary, Moffat, Alistair, Tait, John, Baeza-Yates, Ricardo, ...
We introduce the \emph{synonymy graph} as a new angle of looking at spectral retrieval techniques, including latent semantic indexing (LSI) and its many successors. The synonymy graph is defined for...