Sciweavers

217 search results - page 5 / 44
» Query Execution Techniques for Caching Expensive Methods
Sort
View
GLVLSI
2008
IEEE
140views VLSI» more  GLVLSI 2008»
15 years 4 months ago
A table-based method for single-pass cache optimization
Due to the large contribution of the memory subsystem to total system power, the memory subsystem is highly amenable to customization for reduced power/energy and/or improved perf...
Pablo Viana, Ann Gordon-Ross, Edna Barros, Frank V...
AI
2008
Springer
14 years 9 months ago
Speculative plan execution for information gathering
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
Greg Barish, Craig A. Knoblock
VLDB
2004
ACM
126views Database» more  VLDB 2004»
15 years 2 months ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki
BNCOD
2011
356views Database» more  BNCOD 2011»
13 years 9 months ago
Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resul...
Abhishek Mukherji, Elke A. Rundensteiner, Matthew ...
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
15 years 3 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster