Study on processing hierarchical structures in relational databases within a distributed application

The paper focuses on presenting systematic design techniques for processing hierarchical structures: we deal with representation and data selection techniques, as well as with processing ones. We comparatively present these methods and discuss their run-time efficiency based on a dedicated benchmark. The paper also addresses methods for optimizing database access; in this respect, we briefly present some database optimization actions that we have performed consequent to log processing. Case studies are performed on AcademicInfo information system that we have designed and implemented. We reveal the advantages of parameterized stored procedures and of using MS SQL WITH statement in processing hierarchic structures.