A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
Utkarsh Srivastava, Peter J. Haas, Volker Markl, M...
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...