Sciweavers

1160 search results - page 27 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 4 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
BNCOD
2011
356views Database» more  BNCOD 2011»
12 years 11 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 ...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
13 years 2 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
VLDB
2000
ACM
151views Database» more  VLDB 2000»
14 years 2 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 11 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden