508 search results - page 67 / 102 » Bringing Order to Query Optimization |
142
click to vote
ISAAC
2009
Springer
15 years 9 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 ...
126
click to vote
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
122
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
140
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
162
Voted
PODS
2002
ACM
16 years 2 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...