In this paper we compare four selection strategies in evolutionary optimization of information retrieval (IR) in a question answering setting. The IR index has been augmented by li...
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
: Due to the ever increasing impacts of globalization, people will/have to work on data which is distributed all around the world [LKK+ 97]. Query processing on the corresponding d...
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...