Sciweavers

87 search results - page 3 / 18
» OLAP over Imprecise Data with Domain Constraints
Sort
View
WIDM
2003
ACM
14 years 26 days ago
Answering imprecise database queries: a novel approach
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfa...
Ullas Nambiar, Subbarao Kambhampati
DAWAK
2011
Springer
12 years 7 months ago
OLAP Formulations for Supporting Complex Spatial Objects in Data Warehouses
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...
Ganesh Viswanathan, Markus Schneider
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 9 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
DAWAK
2006
Springer
13 years 11 months ago
Extending Visual OLAP for Handling Irregular Dimensional Hierarchies
Comprehensive data analysis has become indispensable in a variety of environments. Standard OLAP (On-Line Analytical Processing) systems, designed for satisfying the reporting need...
Svetlana Mansmann, Marc H. Scholl
ICDT
2001
ACM
153views Database» more  ICDT 2001»
14 years 2 days ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...