Sciweavers

357 search results - page 9 / 72
» An Algebraic Approach to the Complexity of Generalized Conju...
Sort
View
LICS
2010
IEEE
13 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
DOLAP
2004
ACM
14 years 1 months ago
Evaluating XML-extended OLAP queries based on a physical algebra
In today’s OLAP systems, integrating fast changing data, e.g., stock quotes, physically into a cube is complex and time-consuming. The widespread use of XML makes it very possib...
Xuepeng Yin, Torben Bach Pedersen
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
ICDE
1997
IEEE
127views Database» more  ICDE 1997»
14 years 9 months ago
A Generic Query-Translation Framework for a Mediator Architecture
A mediator is a domain-speci c tool to support uniform access to multiple heterogeneous information sources and to abstract and combine data from different but related databases t...
Jacques Calmet, Sebastian Jekutsch, Joachim Sch&uu...
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 8 months ago
Discovering complex matchings across web query interfaces: a correlation mining approach
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han