Sciweavers

1805 search results - page 43 / 361
» A Theory of Closure Operators
Sort
View
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 8 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
COLING
1996
15 years 5 months ago
An Evaluation Semantics for DATR Theories
This paper describes an operational semantics for DATR theories. The semantics is presented as a set of inference rules that axiomatises the evaluation relationship for DATR expre...
Bill Keller
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 4 months ago
Model Management and Schema Mappings: Theory and Practice
We present an overview of a tutorial on model management--an approach to solving data integration problems, such as data warehousing, e-commerce, object-to-relational mapping, sch...
Philip A. Bernstein, Howard Ho
BIRTHDAY
2006
Springer
15 years 7 months ago
Probability Theory on IF Events
Following M. Krachounov ([5]), max and min operations with fuzzy sets are considered instead of Lukasiewicz ones ([6], [7], [8], [9]). Her the domain F of a probability m : F [0, ...
Beloslav Riecan
155
Voted
ICDCS
2011
IEEE
14 years 3 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley