Paper Info
Title
Supporting VLSI Geometry Operations in a Database System
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.
Year
DOI
Venue
1986
10.1109/ICDE.1986.7266247
ICDE
Keywords
Field
DocType
vlsi geometry operations,database system,geometry,data structures,layout,vegetation,yttrium,database systems,very large scale integration
Data mining,Data structure,Expression (mathematics),Computer science,Database design,Tree structure,Time complexity,Very-large-scale integration,Database,Vlsi layout
Conference
ISBN
Citations 
PageRank 
0-8186-0655-X
12
32.28
References 
Authors
6
2
Name
Order
Citations
PageRank
Jay Banerjee1984422.56
Won Kim234131702.29