Sciweavers

619 search results - page 86 / 124
» Query Planning in Infomaster
Sort
View
EDBT
2002
ACM
141views Database» more  EDBT 2002»
16 years 2 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 6 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 5 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
119
Voted
WWW
2004
ACM
16 years 2 months ago
Through different eyes: assessing multiple conceptual views for querying web services
We present enhancements for UDDI / DAML-S registries allowing cooperative discovery and selection of Web services with a focus on personalization. To find the most useful service ...
Wolf-Tilo Balke, Matthias Wagner
ICPADS
2005
IEEE
15 years 7 months ago
A Model for Distributing and Querying a Data Warehouse on a Computing Grid
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
Pascal Wehrle, Maryvonne Miquel, Anne Tchounikine