ACM Home Page
Please provide us with feedback. Feedback
Representability of design objects by ancestor-controlled hierarchical specifications
Full text PdfPdf (1.07 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Nashville, Tennessee, United States
Pages: 28 - 39  
Year of Publication: 1990
ISBN:0-89791-352-3
Authors
Lin Yu  Department of Computer Science, State University of New York at Albany, Albany, New York
Daniel J. Rosenkrantz  Department of Computer Science, State University of New York at Albany, Albany, New York
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/298514.298539
What is a DOI?

ABSTRACT

A simple model, called a VDAG, is proposed for representing hierarchically specified design data in CAD database systems where there are to be alternate expansions of hierarchically specified modules. The model uses an ancestor-based expansion scheme to control which instances of submodules are to be placed within each instance of a given module. The approach is aimed at reducing storage space in engineering design database systems, and providing a means for designers to specify alternate expansions of a module. The expressive power of the VDAG model is investigated, and the set of design forests which are VDAG-generable is characterized. The problem of determining whether a given design forest is VDAG-generable is shown to be NP-complete, even when the height of the forest is bounded. However, it is shown that determining whether a given forest is VDAG-generable and producing such a VDAG if it exists, can be partitioned into a number of simpler subproblems, each of which may not be too computationally difficult in practice. Furthermore, for forests in a special natural class that has broad applicability, a polynomial time algorithm is provided that determines whether a given forest is VDAG-generable, and produces such a VDAG if it exists. However, we show that it is NP-hard to produce a minimum-sized such VDAG for forests in this special class, even when the height of the forest is bounded.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BK
 
DL
FM
 
GJ
Hec
 
HM
Hunt, J.W., and Mellroy, M.D., "An Algorithm for Differential File Comparison," Computer Science Technical Report 41, AT&T Bell Laboratories, Murray Hill, NJ, 1976
 
Kat
 
KB
Katz, R.H., Bhateja, R., Chang, E.E.L., Gedge, D., and Trijanto, V., "Design Version Management," IEEE Design & Test, Vol.4(1), pp. 12-22, Feb. 1987
 
KL
Katz, R.H., and Lehman, T.J., "Database Support for Versions and Alternatives of Large Design Files," 1EEE Trans. on Software Engineering, Vol.SE-IO(2), pp.191- 200, March 1984
 
Knu
 
Roc
Rochkind, M.J., "The Source Code Control System," 1EEE Trans. on Software Engineering, Vol.Se-l(4), pp.364-370, Dec. 1975
SL
 
Tic
 
U
Unix User's Reference Manual, Dept. E.E. & Comp. Sei., UC Berkeley, CA, April 1986
 
VHDL
VHDL Language Reference Manual, Draft Standard 1076/B, IEEE, May 1987
YR1
 
YR2
Yu, L., and Rosenkrantz, D.J., "Ancestor- Controlled Submodule Inclusion in Design Databases," Proc. Second International Conference on Data and Knowledge Systems for Manufacturing and Engineering, pp.28-37, Gaithersburg, MD, IEEE, Oct. 1989


Collaborative Colleagues:
Lin Yu: colleagues
Daniel J. Rosenkrantz: colleagues