Given a directed graph, k-hop reachability query, u→?kv, is used to check for the existence of path from u v that has length at most k. Addressing queries fundamental task in graph theory and been extensively investigated. However, existing algorithms can be inefficient when answering because they require costly traversal operations. To improve query performance, we propose an approach based on...

Model interpreters play an essential role in modelintegrated systems: they transform domain-specific models into executable models. The state-ot-the-art of model interpreter writing needs to be advanced to enhance the reusability and maintainability of this software. This paper presents an approach which makes this possible through the use of structured specifications. These specifications let ...

Forward traversal methods are used to process queries having nested predicates in object-oriented databases. To expedite the forward traversal, a signature replication technique is proposed. Object signature is a signature formed b y values of all atomic attributes defined in the object. When an object refers to other objects through its attribute, the object signature of the referred object is...