Contextual data plays an important role in modeling search engine users’ behaviors on both query auto-completion (QAC) log and normal query (click) log. User’s recent search history on each log has been widely studied individually as the context to benefit the modeling of users’ behaviors on that log. However, there is no existing work that explores or incorporates both logs together for contex...

Distance oracles are data structures that provide fast (possibly approximate) answers to shortest-path and distance queries in graphs. The tradeoff between the space requirements and the query time of distance oracles is of particular interest and the main focus of this paper. Unless stated otherwise, we assume all graphs to be planar and undirected. In FOCS 2001 (J. ACM 2004), Thorup introduce...

We consider dynamic and online variants of 2D pattern matching between an m×m pattern and an n× n text. All the algorithms we give are randomised and give correct outputs with at least constant probability. – For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed in O(log n) time and queries in O(log m) time. – We then consider a mode...

We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where...

Our group NEXTI participated in the Query Understanding subtask for Japanese. We extracted subtopic candidates from retrieved web documents. Then, we merged them with query suggestion and query log data. We also identified the vertical intent of each subtopic using a method that combines machine learningand kNN-based methods. We conducted experiments and confirmed the effectiveness of our method.

 Exploring synonyms within large commercial site search engine queries Julia Kiseleva, Andrey Simanovsky HP Laboratories HPL-2011-41 synonym mining, query log analysis We describe results of experiments of extract-ing synonyms from large commercial site search engine query log. Our primary object is product search queries. The resulting dictionary of synonyms can be plugged into a search engin...

The database skyline query (or non-domination query) has a spatial form: Given set P with n point sites, and S of m locations interest, site p ∈ is if only for each q ∖ { } , there exists at least one location s that closer to than . We reduce the problem determining points finding sites have non-empty cells in an additively weighted Voronoi diagram under convex distance function. weights said ...

This problem comes in two distinct avors In query mode preprocessing is allowed and q is a query to be an swered on line In o line mode we are given the array A and a set of d rectangles q qm and we must com pute the m sums A qi Partial sum is a special case of the classical orthogonal range searching problem Given n weighted points in d space and a query d rectangle q compute the cumulative we...

Let I be the set of intervals with end points in the integers 1 : : :n. Associated with each element in I is a value from a commutative semigroup S. Two operations are to be implemented: update of the value associated with an interval and query of the sum of the values associated with the intervals which include an integer. If the values are from a commutative group (i.e., inverses exist) then ...

We aim to study the set of color sets of continuous regions of an image given as a matrix of m rows over n ≥ m columns where each element in the matrix is an integer from [1, σ] named a color. The set of distinct colors in a region is called fingerprint. We aim to compute, index and query the fingerprints of all rectangular regions named rectangles. The set of all such fingerprints is denoted b...