6004 search results - page 665 / 1201 » Parallelizing query optimization |
138
click to vote
FOCS
1995
IEEE
15 years 8 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
146
click to vote
CCCG
2010
15 years 6 months ago
2010
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
119
click to vote
TREC
1994
15 years 6 months ago
1994
Full-text scanning oers signi cant advantages over other methods of document retrieval but is normally too slow for use on large collections. The Fujitsu AP1000 parallel distribut...
220
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is ...
219
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we argue that developing information extraction (IE) programs using Datalog with embedded procedural extraction predicates is a good way to proceed. First, compared ...