Sciweavers

357 search results - page 18 / 72
» An Algebraic Approach to the Complexity of Generalized Conju...
Sort
View
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 8 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
EDBT
2010
ACM
147views Database» more  EDBT 2010»
14 years 2 months ago
A simple (yet powerful) algebra for pervasive environments
Querying non-conventional data is recognized as a major issue in new environments and applications such as those occurring in pervasive computing. A key issue is the ability to qu...
Yann Gripay, Frédérique Laforest, Je...