In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the objects of S intersected by q can be answered efficiently. Although range-aggregate queries have been widely investigated in the past for aggregation functions like average, count, min, max, sum etc. there is little wor...

Given a k-character query string and an array of n strings arranged in lexicographical order, computing the rank of the query string among the n strings or deciding whether it occurs in the array requires the inspection of k log logn log log (4 + k log log n logn ) + k + logn ! characters in the worst case.

Query auto-completion (QAC) is a common interactive feature for assisting users during query formulation. Following each query input keystroke, QAC suggests queries prefixed by the input characters; allowing the user to avoid further cognitive and physical effort if any are acceptable. To rank suggestions, QAC approaches typically aggregate past query popularity to determine the likelihood of a...

We present linear space sublogarithmic algorithms for handling the three dimensional dominance reporting problem and the two dimensional range counting problem Under the RAM model as described in M L Fredman and D E Willard Surpassing the information theoretic bound with fusion trees Journal of Computer and System Sciences our algorithms achieve O logn log logn f query time for D dominance repo...

In this paper, we present algorithms for the top-k nearest neighbor searching where the input points are exact and the query point is uncertain under the L1 metric in the plane. The uncertain query point is represented by a discrete probability distribution function, and the goal is to efficiently return the top-k expected nearest neighbors, which have the smallest expected distances to the que...

INTRODUCTION Web query log is a type of file keeping track of the activities of the users who are utilizing a search engine. Compared to traditional information retrieval setting in which documents are the only information source available, query logs are an additional information source in the Web search setting. Based on query logs, a set of Web mining techniques, such as log-based query clus...

In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinate axes (xand y-axis). We call such a triangle an axis parallel triangle. For the axis parallel triangular range search problem, we propose a data structure of size O(NB ( log B N log B log B N ) ) disk blocks and a que...