The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Graph Encoding and Recursion Computation
Abstract
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
Tereza Raquel Merlo, Nayana Madali M. Pampapura, Jason M. Merlo.
© 2024.
14 pages.
|
Kris Swen Helge.
© 2024.
9 pages.
|
Ahmad Tasnim Siddiqui, Gulshaira Banu Jahangeer, Amjath Fareeth Basha.
© 2024.
12 pages.
|
Jennie Lee Khun.
© 2024.
19 pages.
|
Tereza Raquel Merlo.
© 2024.
19 pages.
|
Akash Bag, Paridhi Sharma, Pranjal Khare, Souvik Roy.
© 2024.
31 pages.
|
Akash Bag, Upasana Khattri, Aditya Agrawal, Souvik Roy.
© 2024.
28 pages.
|
|
|