scispace - formally typeset
Search or ask a question

Showing papers on "Graph database published in 1979"


Journal ArticleDOI
TL;DR: This paper delineates the programs representable by an acyclic call graph and presents an algorithm for constructing it using the property that its nodes may be linearly ordered and proves the correctness of the algorithm.
Abstract: The proliferation of large software systems written in high level programming languages insures the utility of analysis programs which examine interprocedural communications. Often these analysis programs need to reduce the dynamic relations between procedures to a static data representation. This paper presents one such representation, a directed, acyclic graph named the call graph of a program. We delineate the programs representable by an acyclic call graph and present an algorithm for constructing it using the property that its nodes may be linearly ordered. We prove the correctness of the algorithm and discuss the results obtained from an implementation of the algorithm in the PFORT Verifier [1].

304 citations


Journal ArticleDOI
TL;DR: The query language XQL is introduced, and the XQL translator is described in some detail, which can be translated and disambiguated by analyzing the queries using the conceptual graphs of a database skeleton.
Abstract: The concept of a database skeleton which reflects both the user's conception of the real world and the system's understanding of the interrelationships among database entities is described. It consists of a conceptual schema (conceptual graphs) and a relational schema (information graph). With the aid of the database skeleton, fuzzy queries can be translated and disambiguated by analyzing the queries using the conceptual graphs of a database skeleton. The query language XQL is introduced, and the XQL translator is described in some detail.

49 citations