589 search results - page 5 / 118 » Optimized Query Evaluation Using Cooperative Sorts |
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
BNCOD
2003
13 years 8 months ago
2003
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
SIGMOD
2012
ACM
11 years 9 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
ICDE
1995
IEEE
14 years 8 months ago
1995
IEEE
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
SDM
2010
SIAM
13 years 8 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...