Sciweavers

505 search results - page 29 / 101
» Efficient Temporal Join Processing Using Indices
Sort
View
DLOG
2010
13 years 5 months ago
Query Algebra and Query Optimization for Concept Assertion Retrieval
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
Jeffrey Pound, David Toman, Grant E. Weddell, Jiew...
CF
2006
ACM
13 years 9 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
WWW
2005
ACM
14 years 8 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
VIS
2007
IEEE
149views Visualization» more  VIS 2007»
14 years 8 months ago
Time Dependent Processing in a Parallel Pipeline Architecture
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...
John Biddiscombe, Berk Geveci, Ken Martin, Kenn...