4438 search results - page 345 / 888 » Speculative Query Processing |
231
click to vote
DOLAP
2005
ACM
15 years 9 months ago
2005
ACM
OLAP users heavily rely on visualization of query answers for their interactive analysis of massive amounts of data. Very often, these answers cannot be visualized entirely and th...
217
click to vote
DOLAP
2005
ACM
15 years 9 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
213
click to vote
DKE
2006
15 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
186
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
225
click to vote
BIRTHDAY
2004
Springer
16 years 21 days ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...