{"title":"面向对象数据库的索引技术","authors":"Won Kim, Kyung-Chang Kim, A. Dale","doi":"10.1145/63320.66510","DOIUrl":null,"url":null,"abstract":"Object Oriented Database systems (OODBs) need e cient indexing techniques just like other Database systems. However, B+-trees which work very well for Relational Database systems are not good enough for OODBs. Several alternate indexing techniques have been proposed, amongst them H-trees. This report analyses indexing techniques for OODBs, in particular H-trees.","PeriodicalId":207946,"journal":{"name":"Object-Oriented Concepts, Databases, and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"134","resultStr":"{\"title\":\"Indexing Techniques for Object-Oriented Databases\",\"authors\":\"Won Kim, Kyung-Chang Kim, A. Dale\",\"doi\":\"10.1145/63320.66510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Object Oriented Database systems (OODBs) need e cient indexing techniques just like other Database systems. However, B+-trees which work very well for Relational Database systems are not good enough for OODBs. Several alternate indexing techniques have been proposed, amongst them H-trees. This report analyses indexing techniques for OODBs, in particular H-trees.\",\"PeriodicalId\":207946,\"journal\":{\"name\":\"Object-Oriented Concepts, Databases, and Applications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"134\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Object-Oriented Concepts, Databases, and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/63320.66510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Object-Oriented Concepts, Databases, and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/63320.66510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Object Oriented Database systems (OODBs) need e cient indexing techniques just like other Database systems. However, B+-trees which work very well for Relational Database systems are not good enough for OODBs. Several alternate indexing techniques have been proposed, amongst them H-trees. This report analyses indexing techniques for OODBs, in particular H-trees.