Sciweavers

99 search results - page 8 / 20
» On the complexity of division and set joins in the relationa...
Sort
View
ICCS
2004
Springer
14 years 1 months ago
DisCAS: A Distributed-Parallel Computer Algebra System
The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra ...
Yongwei Wu, Guangwen Yang, Weimin Zheng, Dongdai L...
LICS
2002
IEEE
14 years 25 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
JAR
2006
236views more  JAR 2006»
13 years 8 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
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 9 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
ENTCS
2006
153views more  ENTCS 2006»
13 years 8 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu