Sciweavers

164 search results - page 24 / 33
» A Relational Algebra for Functional Logic Deductive Database...
Sort
View
DBPL
1995
Springer
106views Database» more  DBPL 1995»
14 years 1 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
CAISE
2003
Springer
14 years 3 months ago
On the Applicability of Rules to Automate Data Warehouse Logical Design
Data Warehouse logical design involves the definition of structures that enable an efficient access to information. The designer builds relational or multidimensional structures ta...
Verónika Peralta, Alvaro Illarze, Raul Rugg...
ICLP
2007
Springer
14 years 1 months ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
CADE
1998
Springer
14 years 2 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
WWW
2007
ACM
14 years 10 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres