go-v.orgdoi

Teaching Structured Design of Network Algorithms in Enhanced Versions of SQL

Bert de Brock · Journal of Information Technology Education Research · 2004

  • DOI 10.28945/285
  • Publisher Informing Science Institute
  • Type article
  • Issued 2004

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Journal of Information Technology Education Research · Informing Science Institute · article · 2004

Abstract

From time to time developers of (database) applications will encounter, explicitly or implicitly, structures such as trees, graphs, and networks.Such applications can, for instance, relate to bills of material, organization charts, networks of (rail)roads, networks of conduit pipes (e.g., plumbing, electricity), telecom networks, and data dictionaries.Algorithms on such data structures often require recursion or iteration where the number of repetitions is unknown a priori.Such algorithms are usually implemented in a third generation language (3GL) and, therefore, are typically "record-at-a-time".A vast amount of theoretical work on recursive queries in logical languages (and related problems in research prototypes) is available, but these "extensions" typically are not available in commercial database management systems.Hence, they do not directly help the database developer "in the field" who has available only "ordinary" SQL with a few enhancements.One of the advantages of our uniform 4GL-approach is that it makes the practical development of ad hoc queries in such (recursive) application areas considerably easier, i.e., both simpler and faster, than a mixed 3GL/4GL-approach, using 3GL host languages with embedded SQL.As a consequence, it facilitates both the development and management of information systems in those application areas.Even on 4GL-level the student can influence the efficiency of the graph algorithms.Therefore, we present some incremental improvements on our algorithms, all successively leading to better results.All programs turn out to be rather compact; they consist of only a small number of SQL-statements.This clearly contributes to the transparency of the structure of the algorithms and the maintainability of the software, and therefore makes it also very suitable for educational purposes.

Open the resolved locator · 10.28945/285

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 01:21 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://www.informingscience.org/Publications/285
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.