{"title":"使用路径索引优化面向对象查询","authors":"E. Bertino, C. Guglielmina","doi":"10.1109/RIDE.1992.227413","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing a single predicate. Here they consider the usage of the path index in the framework of more general queries containing several predicates.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Optimization of object-oriented queries using path indices\",\"authors\":\"E. Bertino, C. Guglielmina\",\"doi\":\"10.1109/RIDE.1992.227413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing a single predicate. Here they consider the usage of the path index in the framework of more general queries containing several predicates.<<ETX>>\",\"PeriodicalId\":138660,\"journal\":{\"name\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIDE.1992.227413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIDE.1992.227413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
摘要
本文研究了面向对象数据库中嵌套谓词的高效求值问题。作者之前引入了路径索引的概念(E. Bertino et al., 1989),它将嵌套属性的值与给定聚合层次结构的类根实例关联起来。他们在包含单个谓词的查询情况下评估路径索引的性能。这里,他们考虑在包含多个谓词的更一般查询框架中使用路径索引
Optimization of object-oriented queries using path indices
This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing a single predicate. Here they consider the usage of the path index in the framework of more general queries containing several predicates.<>