Sciweavers

1302 search results - page 67 / 261
» Fair Equivalence Relations
Sort
View
APAL
2008
87views more  APAL 2008»
13 years 9 months ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
TCS
2010
13 years 7 months ago
Contract-based discovery of Web services modulo simple orchestrators
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
Luca Padovani
SIGMOD
2002
ACM
141views Database» more  SIGMOD 2002»
13 years 8 months ago
Bringing Order to Query Optimization
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
DEXA
2009
Springer
177views Database» more  DEXA 2009»
14 years 3 months ago
Querying XML Data with SPARQL
SPARQL is today the standard access language for Semantic Web data. In the recent years XML databases have also acquired industrial importance due to the widespread applicability o...
Nikos Bikakis, Nektarios Gioldasis, Chrisa Tsinara...
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
14 years 2 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....