Sciweavers

619 search results - page 21 / 124
» Query Planning in Infomaster
Sort
View
DOLAP
2003
ACM
15 years 7 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
113
Voted
PAKDD
2005
ACM
132views Data Mining» more  PAKDD 2005»
15 years 7 months ago
On Multiple Query Optimization in Data Mining
Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
Marek Wojciechowski, Maciej Zakrzewicz
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 8 months ago
On Social-Temporal Group Query with Acquaintance Constraint
Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to ...
De-Nian Yang, Yi-Ling Chen, Wang-Chien Lee, Ming-S...
PVLDB
2010
172views more  PVLDB 2010»
15 years 8 days ago
Database-support for Continuous Prediction Queries over Streaming Data
Prediction is emerging as an essential ingredient for real-time monitoring, planning and decision support applications such as intrusion detection, e-commerce pricing and automate...
Mert Akdere, Ugur Çetintemel, Eli Upfal
132
Voted
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 8 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner