2850 search results - page 296 / 570 » Answering Queries using Humans, Algorithms and Databases |
136
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
148
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
145
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
183
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
136
Voted
MDM
2010
Springer
15 years 8 months ago
2010
Springer
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...