Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

We consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds
on dynamic data structures and graph problems. This line of work was initiated by Pâtraşcu …

In recent years much effort has been concentrated towards achieving polynomial time lower
bounds on algorithms for solving various well-known problems. A useful technique for …

We study the problem of approximate shortest path queries in chordal graphs and give an
log n+ o (n log n) bit data structure to answer the approximate distance query to within an …

In the last few years, much effort has been devoted to developing join algorithms to achieve
worst-case optimality for join queries over relational databases. Towards this end, the …

Min-wise hashing is an important method for estimating the size of the intersection of sets,
based on a succinct summary (a" min-hash") of each set. One application is estimation of the …

The topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

The inverted index is the backbone of modern web search engines. For each word in a
collection of web documents, the index records the list of documents where this word occurs …

The Eclat algorithm is one of the most widely used frequent itemset mining methods.
However, the inefficiency for calculating the intersection of itemsets makes it a time …