1890 search results - page 214 / 378 » Querying Big Data by Accessing Small Data |
170
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Keeping the test databases as small as possible leads to faster execution of tests and facilitates the task of completing the test cases and evaluating the actual outputs against ...
PVLDB
2010
14 years 9 months ago
2010
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
110
click to vote
BDA
2007
15 years 25 days ago
2007
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
107
click to vote
SODA
1993
ACM
15 years 21 days ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...