{"title":"在数据库系统中支持VLSI几何运算","authors":"J. Banerjee, Won Kim","doi":"10.1109/ICDE.1986.7266247","DOIUrl":null,"url":null,"abstract":"VLSI layout systems perform various operations on design data describing the layouts of geometries (rectangles) on different mask layers. In this paper, we identify a basic set of such operations and show a formulation of these operations in terms of expressions of predicates that are suitable for processing by a database system. We then describe the operations and properties of a 4-D (four-dimensional) tree structure for efficiently supporting these operations. We also provide a qualitative analysis of the time complexity of the data structure, which compares favorably against various existing proposals.","PeriodicalId":415748,"journal":{"name":"1986 IEEE Second International Conference on Data Engineering","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Supporting VLSI geometry operations in a database system\",\"authors\":\"J. Banerjee, Won Kim\",\"doi\":\"10.1109/ICDE.1986.7266247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"VLSI layout systems perform various operations on design data describing the layouts of geometries (rectangles) on different mask layers. In this paper, we identify a basic set of such operations and show a formulation of these operations in terms of expressions of predicates that are suitable for processing by a database system. We then describe the operations and properties of a 4-D (four-dimensional) tree structure for efficiently supporting these operations. We also provide a qualitative analysis of the time complexity of the data structure, which compares favorably against various existing proposals.\",\"PeriodicalId\":415748,\"journal\":{\"name\":\"1986 IEEE Second International Conference on Data Engineering\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-02-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1986 IEEE Second International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1986.7266247\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1986 IEEE Second International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1986.7266247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Supporting VLSI geometry operations in a database system
VLSI layout systems perform various operations on design data describing the layouts of geometries (rectangles) on different mask layers. In this paper, we identify a basic set of such operations and show a formulation of these operations in terms of expressions of predicates that are suitable for processing by a database system. We then describe the operations and properties of a 4-D (four-dimensional) tree structure for efficiently supporting these operations. We also provide a qualitative analysis of the time complexity of the data structure, which compares favorably against various existing proposals.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
