Name
Abstract | ||
|---|---|---|
While relational database technology has dominated the database field for more than a decade, object-oriented database (OODB) technology has recently gained a lot of attention in the database community. Many researchers are concerned about the performance of OODBs. This paper proposes an OODB design methodology called fragmented hash-indexed (FHIN) that is aimed at improving the operating performance of OODBs. The FHIN model's storage structure contains an Instances–Classes Table (ICT) with a two-segment data design. Query processing is done by accessing data segments through ICT with an algorithm introduced here. The FHIN model uses three access methods: hashing, indexing, or hash-indexing. The database performance of FHIN is compared to two previous access methods using 1050 simulation runs. Results indicate that the FHIN model is 43% better than either of the other models in smaller databases, 65% better in larger databases, 50% better under conditions of high updating, and 72% better under conditions of low updating. These results suggest that FHIN methodology has promise and is worthy of exploration and OODB software development. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0950-5849(99)00028-2 | Information and Software Technology |
Keywords | Field | DocType |
Database,Object-oriented,Data structure,Database performance,Database management systems,Access methods | Data structure,Data mining,Database tuning,Access method,Relational database,Object-oriented programming,Computer science,Search engine indexing,Database design,Database theory,Database | Journal |
Volume | Issue | ISSN |
41 | 10 | 0950-5849 |
Citations | PageRank | References |
1 | 0.37 | 19 |
Authors | ||
2 | ||