Sciweavers

384 search results - page 6 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
PEPM
2010
ACM
14 years 4 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
ECCC
2008
98views more  ECCC 2008»
13 years 7 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
A Structure Causality Relation for Liveness Characterisation in Petri Nets
: Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In this paper, we introduce a structure causality relation from which a topologic...
Belhassen Zouari
EDBT
2000
ACM
13 years 11 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
25
Voted
PODS
1997
ACM
124views Database» more  PODS 1997»
13 years 12 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin