Sciweavers

193 search results - page 34 / 39
» Processing and Optimization of Complex Queries in Schema-Bas...
Sort
View
CIDR
2007
100views Algorithms» more  CIDR 2007»
13 years 9 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
DELOS
2000
13 years 9 months ago
Challenging Ubiquitous Inverted Files
Stand-alone ranking systems based on highly optimized inverted file structures are generally considered `the' solution for building search engines. Observing various developm...
Arjen P. de Vries
PODS
2002
ACM
98views Database» more  PODS 2002»
14 years 7 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
DEXA
2000
Springer
132views Database» more  DEXA 2000»
14 years 1 days ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 2 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...