Sciweavers

32 search results - page 6 / 7
» Learning-Based Top-N Selection Query Evaluation over Relatio...
Sort
View
SIGMOD
2003
ACM
193views Database» more  SIGMOD 2003»
14 years 6 months ago
Chain : Operator Scheduling for Memory Minimization in Data Stream Systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in ...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 6 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 27 days 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
DAWAK
1999
Springer
13 years 11 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
NAR
2007
109views more  NAR 2007»
13 years 6 months ago
GeneTrees: a phylogenomics resource for prokaryotes
The GeneTrees phylogenomics system pursues comparative genomic analyses from the perspective of gene phylogenies for individual genes. The GeneTrees project has the goal of provid...
Yuying Tian, Allan W. Dickerman