Sciweavers

710 search results - page 133 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
LPNMR
2005
Springer
14 years 1 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 2 months ago
Rule-based multi-query optimization
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together tha...
Mingsheng Hong, Mirek Riedewald, Christoph Koch, J...
COOPIS
2002
IEEE
14 years 18 days ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 7 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...