Multiple Implementations for a Set of Objects

Masayoshi ARITSUGI; Kan YAMAMOTO; Akifumi MAKINOUCHI

Multiple Implementations for a Set of Objects

Masayoshi ARITSUGI, Kan YAMAMOTO, Akifumi MAKINOUCHI

Full Text Views

0

Cite this

Summary :

When a set of objects is shared among several applications, multiple implementations for the set are required in order to suit each application as much as possible. Furthermore, if a set of objects could have multiple implementations, the following issues arise: (1) how to select the best implementation when processing queries on the set, and (2) how to propagate updates on an implementation of the set to the others. In this paper we propose a mechanism of multiple implementations for a set, and also give a solution for the latter issue. In the proposal a set can be of multiple types, and each of the types corresponds to an implementation already contained within the set. Update propagation can be achieved by a rewriting technique at compilation time. We also present a performance study in which the feasibility and effectiveness of our proposal were examined.

Publication: IEICE TRANSACTIONS on Information Vol.E81-D No.2 pp.183-192

Publication Date: 1998/02/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Databases

Cite this

Copy

Masayoshi ARITSUGI, Kan YAMAMOTO, Akifumi MAKINOUCHI, "Multiple Implementations for a Set of Objects" in IEICE TRANSACTIONS on Information, vol. E81-D, no. 2, pp. 183-192, February 1998, doi: .
Abstract: When a set of objects is shared among several applications, multiple implementations for the set are required in order to suit each application as much as possible. Furthermore, if a set of objects could have multiple implementations, the following issues arise: (1) how to select the best implementation when processing queries on the set, and (2) how to propagate updates on an implementation of the set to the others. In this paper we propose a mechanism of multiple implementations for a set, and also give a solution for the latter issue. In the proposal a set can be of multiple types, and each of the types corresponds to an implementation already contained within the set. Update propagation can be achieved by a rewriting technique at compilation time. We also present a performance study in which the feasibility and effectiveness of our proposal were examined.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_2_183/_p

Copy

@ARTICLE{e81-d_2_183,
author={Masayoshi ARITSUGI, Kan YAMAMOTO, Akifumi MAKINOUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Multiple Implementations for a Set of Objects},
year={1998},
volume={E81-D},
number={2},
pages={183-192},
abstract={When a set of objects is shared among several applications, multiple implementations for the set are required in order to suit each application as much as possible. Furthermore, if a set of objects could have multiple implementations, the following issues arise: (1) how to select the best implementation when processing queries on the set, and (2) how to propagate updates on an implementation of the set to the others. In this paper we propose a mechanism of multiple implementations for a set, and also give a solution for the latter issue. In the proposal a set can be of multiple types, and each of the types corresponds to an implementation already contained within the set. Update propagation can be achieved by a rewriting technique at compilation time. We also present a performance study in which the feasibility and effectiveness of our proposal were examined.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Multiple Implementations for a Set of Objects
T2 - IEICE TRANSACTIONS on Information
SP - 183
EP - 192
AU - Masayoshi ARITSUGI
AU - Kan YAMAMOTO
AU - Akifumi MAKINOUCHI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1998
AB - When a set of objects is shared among several applications, multiple implementations for the set are required in order to suit each application as much as possible. Furthermore, if a set of objects could have multiple implementations, the following issues arise: (1) how to select the best implementation when processing queries on the set, and (2) how to propagate updates on an implementation of the set to the others. In this paper we propose a mechanism of multiple implementations for a set, and also give a solution for the latter issue. In the proposal a set can be of multiple types, and each of the types corresponds to an implementation already contained within the set. Update propagation can be achieved by a rewriting technique at compilation time. We also present a performance study in which the feasibility and effectiveness of our proposal were examined.
ER -