Sciweavers

649 search results - page 3 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
13 years 11 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
14 years 6 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 6 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
11 years 7 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
JIDM
2010
131views more  JIDM 2010»
13 years 3 days ago
Processing Queries over Distributed XML Databases
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
Guilherme Figueiredo, Vanessa P. Braganholo, Marta...