On the Selection of Optimal Index Configuration in OO Databases

R.S. Choenni; E. Bertino; Henk Blanken; S.C. Chang

doi:10.1109/ICDE.1994.283077

On the Selection of Optimal Index Configuration in OO Databases

R.S. Choenni, E. Bertino, Henk Blanken, S.C. Chang

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

15 Citations (Scopus)

186 Downloads (Pure)

Abstract

An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing techniques.

Original language	Undefined
Title of host publication	Proceedings of the 10th International Conference on Data Engineering (ICDE1994)
Place of Publication	Washington, DC, USA
Publisher	IEEE
Pages	526-537
Number of pages	12
ISBN (Print)	0-8186-5402-3
DOIs	https://doi.org/10.1109/ICDE.1994.283077
Publication status	Published - Feb 1994
Event	10th International Conference Data Engineering, Houston, USA, 1994 - Houston, TX Duration: 14 Feb 1994 → 18 Feb 1994

Publication series

Name
Publisher	IEEE

Conference

Conference	10th International Conference Data Engineering, Houston, USA, 1994
Period	14/02/94 → 18/02/94
Other	14-18 Feb 1994

Keywords

IR-19235
METIS-119758
DB-OODB: OBJECT-ORIENTED DATABASES
EWI-7198

Access to Document

10.1109/ICDE.1994.283077

Cite this

@inproceedings{f317dce2e2b945d3a6d395170b343582,

title = "On the Selection of Optimal Index Configuration in OO Databases",

abstract = "An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing techniques.",

keywords = "IR-19235, METIS-119758, DB-OODB: OBJECT-ORIENTED DATABASES, EWI-7198",

author = "R.S. Choenni and E. Bertino and Henk Blanken and S.C. Chang",

note = "Imported from EWI/DB PMS [db-utwente:inpr:0000003119]; 10th International Conference Data Engineering, Houston, USA, 1994 ; Conference date: 14-02-1994 Through 18-02-1994",

year = "1994",

month = feb,

doi = "10.1109/ICDE.1994.283077",

language = "Undefined",

isbn = "0-8186-5402-3",

publisher = "IEEE",

pages = "526--537",

booktitle = "Proceedings of the 10th International Conference on Data Engineering (ICDE1994)",

address = "United States",

}

TY - GEN

T1 - On the Selection of Optimal Index Configuration in OO Databases

AU - Choenni, R.S.

AU - Bertino, E.

AU - Blanken, Henk

AU - Chang, S.C.

N1 - Imported from EWI/DB PMS [db-utwente:inpr:0000003119]

PY - 1994/2

Y1 - 1994/2

N2 - An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing techniques.

AB - An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing techniques.

KW - IR-19235

KW - METIS-119758

KW - DB-OODB: OBJECT-ORIENTED DATABASES

KW - EWI-7198

U2 - 10.1109/ICDE.1994.283077

DO - 10.1109/ICDE.1994.283077

M3 - Conference contribution

SN - 0-8186-5402-3

SP - 526

EP - 537

BT - Proceedings of the 10th International Conference on Data Engineering (ICDE1994)

PB - IEEE

CY - Washington, DC, USA

T2 - 10th International Conference Data Engineering, Houston, USA, 1994

Y2 - 14 February 1994 through 18 February 1994

ER -