Sciweavers

200 search results - page 8 / 40
» Datalog Queries of Set Constraint Databases
Sort
View
AMW
2010
13 years 8 months ago
Logic Programs for Repairing Inconsistent Dimensions in Data Warehouses
A Data Warehouse (DW) is a data repository that integrates data from multiple sources and organizes the data according to a set of data structures called dimensions. Each dimension...
Loreto Bravo, Mónica Caniupán Marile...
GIS
2008
ACM
14 years 8 months ago
An inconsistency tolerant approach to querying spatial databases
In order to deal with inconsistent databases, a repair semantics defines a set of admissible database instances that restore consistency, while staying close to the original insta...
Leopoldo E. Bertossi, Mónica Caniupá...
ISMIS
2011
Springer
12 years 10 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski
APWEB
2004
Springer
14 years 22 days ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
LCC
1994
213views Algorithms» more  LCC 1994»
13 years 11 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...