To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
This report is part of the seminar Digital Information Curation held by Prof. Dr. Marc H. Scholl and Dr. Andr?e Seifert during the winter term 2005/06. Its intention is to summari...
Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang...
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...