1263 search results - page 139 / 253 » A Scalable Algorithm for Answering Queries Using Views |
137
Voted
DATESO
2010
15 years 1 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
138
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
151
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
127
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
136
click to vote
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...