Sciweavers

1007 search results - page 32 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
16 years 3 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
ICDCS
2007
IEEE
15 years 8 months ago
Two-Tier Multiple Query Optimization for Sensor Networks
When there are multiple queries posed to the resourceconstrained wireless sensor network, it is critical to process them efficiently. In this paper, we propose a Two-Tier Multipl...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
CIKM
2007
Springer
15 years 6 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
IS
2007
15 years 2 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
DASFAA
2004
IEEE
95views Database» more  DASFAA 2004»
15 years 6 months ago
On Incorporating Iceberg Queries in Query Processors
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...
Krishna P. Leela, Pankaj M. Tolani, Jayant R. Hari...