Sciweavers

491 search results - page 17 / 99
» Optimizing Large OODB Queries
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
DASFAA
2006
IEEE
168views Database» more  DASFAA 2006»
14 years 1 months ago
PMJoin: Optimizing Distributed Multi-way Stream Joins by Stream Partitioning
Abstract. In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communica...
Yongluan Zhou, Ying Yan, Feng Yu, Aoying Zhou
EDBTW
2006
Springer
13 years 11 months ago
Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...
Jürgen Krämer, Yin Yang, Michael Cammert...
TKDE
2011
330views more  TKDE 2011»
13 years 2 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 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...