Sciweavers

6905 search results - page 54 / 1381
» Querying Multidimensional Databases
Sort
View
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
14 years 2 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 10 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
DOLAP
2010
ACM
13 years 8 months ago
Towards OLAP query reformulation in peer-to-peer data warehousing
Inter-business collaborative contexts prefigure a distributed scenario where companies organize and coordinate themselves to develop common and shared opportunities. Traditional b...
Matteo Golfarelli, Federica Mandreoli, Wilma Penzo...
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 4 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
14 years 3 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...