ICDT
1997
ACM
13 years 8 months ago
1997
ACM
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
We consider spatial databases and queries definable using first-order logic and real polynomial inequalities. We are interested in topological queries: queries whose result only ...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
Abstract. The correctness of nested transactions for multidatabases differs from that of at transactions in that, for nested transactions the execution order of siblings at each re...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM
A “scoring rule” is an assignment of a value to every tuple (of varying sizes). This paper is concerned with the issue of how to modify a scoring rule to apply to the case whe...
ICDT
1997
ACM
13 years 8 months ago
1997
ACM