<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF8102</article-id><article-id pub-id-type="doi">10.3233/INF-1997-8102</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Complexity analysis of link navigation in Dexter based hypermedia database systems</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Specht</surname><given-names>Günther</given-names></name><email xlink:href="mailto:specht@informatik.tu-muenchen.de">specht@informatik.tu-muenchen.de</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Technische Universität München, Department of Computer Science, Orleansstr. 34, D-81667 München</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>1997</year></pub-date><volume>8</volume><issue>1</issue><fpage>23</fpage><lpage>42</lpage><abstract><p>Today's multimedia and hypermedia systems include such a huge amount of data and links, that they should be stored and maintained by a database system. Then a powerful and efficient database schema is needed. The Dexter hypertext reference model offers a widely accepted, powerful modelling technique for nodes and links. We present its stepwise conversion into a relational multimedia database schema. In the obtained hypermedia engine the most important and most time critical operation is the link navigation. We analyze its complexity in detail and optimize it by schema improvements. Finally we present an efficient implementation of the presented ideas: the System MultiMAP, developed at the TU Munich.</p></abstract><kwd-group><label>Keywords</label><kwd>hypermedia</kwd><kwd>database systems</kwd><kwd>Dexter reference model</kwd><kwd>relational model</kwd><kwd>link navigation</kwd><kwd>complexity analysis</kwd></kwd-group></article-meta></front></article>