Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage

Treffer: Query-driven horizontal class partitioning for object-oriented databases

Title:
Query-driven horizontal class partitioning for object-oriented databases
Authors:
BELLATRECHE, L, KARLAPALEM, K, BASAK, G. K
Source:
DEXA '98 : database and expert systems applications (Vienna, 24-28 August 1998)Lecture notes in computer science. 1460:692-701
Publisher Information:
Berlin: Springer, 1998.
Publication Year:
1998
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Documentation, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Base donnée orientée objet, Object-oriented databases, Base donnée répartie, Distributed database, Base repartida dato, Fragmentation, Fragmentación, Interrogation base donnée, Database query, Interrogación base datos, Système information, Information system, Sistema información
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Science and Technology Clear Water Bay Kowloon, Hong-Kong
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=2289515
Rights:
Copyright 1998 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

FRANCIS
Accession Number:
edscal.2289515
Database:
PASCAL Archive

Weitere Informationen

Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes.