Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Graph Encoding and Recursion Computation

Graph Encoding and Recursion Computation
View Sample PDF
Author(s): Yangjun Chen (University of Winnipeg, Canada)
Copyright: 2005
Pages: 8
Source title: Encyclopedia of Information Science and Technology, First Edition
Source Author(s)/Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-59140-553-5.ch231


View Graph Encoding and Recursion Computation on the publisher's website for pricing and purchasing information.


It is a general opinion that relational database systems are inadequate for manipulating composite objects that arise in novel applications such as Web and document databases (Abiteboul, Cluet, Christophides, Milo, Moerkotte & Simon, 1997; Chen & Aberer, 1998, 1999; Mendelzon, Mihaila & Milo, 1997; Zhang, Naughton, Dewitt, Luo & Lohman, 2001), CAD/ CAM, CASE, office systems and software management. Especially, when recursive relationships are involved, it is cumbersome to handle them in relational databases, which sets current relational systems far behind the navigational ones (Kuno & Rundensteiner, 1998; Lee & Lee, 1998). To overcome this problem, a lot of interesting graph encoding methods have been developed to mitigate the difficulty to some extent. In this article, we give a brief description of some important methods, including analysis and comparison of their space and time complexities.

Related Content

Adeyinka Tella, Oluwakemi Titilola Olaniyi, Aderinola Ololade Dunmade. © 2021. 24 pages.
Md. Maidul Islam. © 2021. 17 pages.
Peterson Dewah. © 2021. 23 pages.
Lungile Precious Luthuli, Thobekile K. Buthelezi. © 2021. 14 pages.
Delight Promise Udochukwu, Chidimma Oraekwe. © 2021. 13 pages.
Julie Moloi. © 2021. 18 pages.
Mandisa Msomi, Lungile Preciouse Luthuli, Trywell Kalusopa. © 2021. 17 pages.
Body Bottom