|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
36th International Conference on Technology of Object-Oriented Languages and Systems (TOOLS-Asia'00)
A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts
Xi'an, China
October 30-November 04
ISBN: 0-7695-0875-8
| ASCII Text | x | ||
| Liu Guohua, Ji Wenyun, Chen Zijun, "A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts," Technology of Object-Oriented Languages, International Conference on, pp. 291, 36th International Conference on Technology of Object-Oriented Languages and Systems (TOOLS-Asia'00), 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/TOOLS.2000.885929, author = {Liu Guohua and Ji Wenyun and Chen Zijun}, title = {A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts}, journal ={Technology of Object-Oriented Languages, International Conference on}, volume = {0}, year = {2000}, issn = {1530-2067}, pages = {291}, doi = {http://doi.ieeecomputersociety.org/10.1109/TOOLS.2000.885929}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Technology of Object-Oriented Languages, International Conference on TI - A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts SN - 1530-2067 SP EP A1 - Liu Guohua, A1 - Ji Wenyun, A1 - Chen Zijun, PY - 2000 KW - object-oriented database KW - normalization KW - user interpretation KW - conflict VL - 0 JA - Technology of Object-Oriented Languages, International Conference on ER - | |||
In this paper, in order to express the user interpretation (a set of user-specified GD-constraints, see [1] in terms of a directed graph, the definition of directed graph in graph theory is extended according to the characters of the user interpretation and the requirement of the problem, and the node in this directed graph may be either an ordinary node or a directed graph. The directed graph (having been extended) expressing the user interpretation is said to be a GD-constraint graph. Based on these, the features of the GD-constraint graph corresponding to the user interpretation without conflicts are extracted. Finally, the sufficient and necessary condition under which the user interpretation doesn't contain conflicts is given, and a polynomial time recognition algorithm which time complexity is O(m n) is proposed on the basis of the sufficient and necessary condition, then, the correctness of the algorithm is proved and the time complexity of the algorithm is analyzed.
Index Terms:
object-oriented database, normalization, user interpretation, conflict
Citation:
Liu Guohua, Ji Wenyun, Chen Zijun, "A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts," tools, pp.291, 36th International Conference on Technology of Object-Oriented Languages and Systems (TOOLS-Asia'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.