Abstract
The HBDS model is a type of data structure essentially built upon the set theory and the hypergraph concept. Four abstract data types are defined, respectively named: class, object, attribute and link. Its architecture is composed of an arborescence, an hypergraph, a forest and two multigraphs. In the inner part of the system, links are transformed into hidden classes and objects, allowing to consider them as hierar-chized. Extensions of the model are proposed in order to reduce the number of links: hyperclass, hyperlink, multilink and hypermultilink. One of the main features of the HBDS is the presence of a skeleton structure which makes the structure immediately understandable, without depending upon the number of the components.
The HBDS may be used in data base modelling and design and is able to ensure almost all tasks and properties like protection, simultaneous shareability and distribution, with which special hidden structures are associated.
The HBDS may be applied to business data with several advantages compared with other models: trees, nets, boxes, which appear as subsets of it.
But, its main possible applications essentially concern the very large scientific data bases with complex-structured data.
The HBDS allows a new scientific approach of data base design and applications by giving us a very general model of data structure which may be used everywhere.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berge, C. Graphes et hypergraphes. Dunod, Paris (1970), 516 pp.
Berge, C. Hypergraphs generalizing bipartite graphs. Integer and non-linear programming, Abadie, North-Holland Pub. (1970), 507–509.
Bouille, F. Un modèle universel de banque de données, simultanément partageable, portable et répartie. Thèse de Doct.ès Sciences, Institut de Programmation, Université Pierre et Marie Curie (1977), 550pp.
Bourbaki, N. Théorie des ensembles. Livre 1, Paris (1939).
Dahl, O.J.; Myhrhaug, B.; Nygaard, K. SIMULA 67 Common Base Language. NCC Pub. S-22 (1971), 145 pp.
Durchholz, R.; Richter, G. Concepts for data base management systems. IFIP Workshop on data base management, Cargèse (1–5 April 1974), North-Holland Pub., 97–121.
Liskov, B.; Zilles, S. Programming with abstract data types. Proc. ACM SIGPLAN symposium on very high-level languages, Santa-Monica (1974), 50–59.
Bibliography
Bouillé, F. A model of scientific data bank and its applications to geological data. International COGEODATA Symposium, Paris (24–26 Nov.1975), Computers and Geosciences, Pergamon Press (1976), 2, 279–291.
Bouillé, F. A model of protected, shareable and portable scientific data bank. Proc. 5th Biennial International CODATA Conference, Boulder(28 June-1st July 1976), Pergamon Press (in printing), 19pp.
Bouillé, F.; Pajaud, D.; Roulet, M.J. Application aux Collections de Paléontologie de l’Université Pierre et Marie Curie d’un nouveau modèle de banque de données. 5ème Réunion Annuelle des Sciences de la Terre, Rennes (38–22 Avril 1977), SGF Edt., 97.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Bouillé, F. (1977). The Hypergraph-Based Data Structure: A New Approach to Data Base Modelling and Application. In: Schneider, H.J. (eds) GI — 7. Jahrestagung. Informatik — Fachberichte, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48908-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-48908-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08425-9
Online ISBN: 978-3-642-48908-2
eBook Packages: Springer Book Archive