1890 search results - page 170 / 378 » Querying Big Data by Accessing Small Data |
184
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
153
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
250
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
183
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
173
click to vote
USENIX
2007
15 years 8 months ago
2007
Virtual machine (VM) memory allocation and VM consolidation can benefit from the prediction of VM page miss rate at each candidate memory size. Such prediction is challenging for...