• Home
  • Search
  • A graph theoretic model of data structures
  • Cite Icon3
  • https://doi.org/10.1145/1095495.1095499Copy DOI Icon

A graph theoretic model of data structures

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The widespread development of large shared data bases has proceeded mainly on empirical notions. Only in the past few years have there been attempts at formalizing the underlying concepts into a theory of data structures. The present models have been founded on the well-established mathematical theories of sets, relations and graphs, but few descriptions have been sufficiently developed to meet the needs of a complete theory of data structures. The set theoretic formalism offered by Childs(1) or Schwartz(2) or the relational model by Codd(3) are useful but fail to give a complete description of the complex structures found in modern data bases. The graph theoretic concepts found in papers by Harary and Hsiao(4) and Earley(5) are more appealing but need further elaboration. This paper is an attempt to develop a graph theoretic model into a useful formalism for describing and manipulating data structures.

Similar Papers
  • Conference Article
  • Citations132

Synthesizing data structure manipulations from storyboards

  • Sep 09, 2011
  • Rishabh Singh +1
  • Research Article
  • Citations2

A method for selecting data subsets from large medical data bases.

  • Apr 01, 1993
  • Journal of medical systems
  • C M Rozewski
  • Research Article
  • Citations1

Associative/parallel processors for searching very large textual data bases

  • Jan 01, 1977
  • ACM SIGIR Forum
  • R M Bird +2
  • Conference Article
  • Citations8

Using large data bases for interactive problem solving

  • Jan 01, 1975
  • Eric D Carlson
  • Research Article
  • Citations3

Language-independent interactive data visualization

  • Jan 11, 2003
  • ACM SIGCSE Bulletin
  • Alistair E R Campbell +2
  • Research Article
  • Citations3

SpectrinoSoftware: Spectra Visualization and Preparation forR

  • Jan 01, 2007
  • Journal of Statistical Software
  • Teodor Krastev
  • Book Chapter
  • Citations2

Computer-Aided Refinement of Data Structures on Higher-Order Algebraic Specifications

  • Jan 01, 2004
  • Walter Dosch +1
  • Research Article
  • Citations14

Soybean Phosphorus and Potassium Requirement Evaluation by Three M‐DRIS Data Bases

  • Mar 01, 1990
  • Agronomy Journal
  • W B Hallmark +6
  • Research Article

The Organization of Exploration Data at the Basin, Play, and Prospect Level

  • Jan 01, 1991
  • AAPG Bulletin
  • Carragher, Peter D., Amoco Producti
  • PDF
  • Research Article
  • Citations25

Solving constrained Horn clauses modulo algebraic data types and recursive functions

  • Jan 12, 2022
  • Proceedings of the ACM on Programming Languages
  • Hari Govind V K +2
  • Conference Article
  • Citations6

Symbolic analysis: a formulation approach by manipulating data structures

  • May 25, 2003
  • E Tielo-Cuautle +2
  • Research Article

Test input generation using separati logic

  • Dec 28, 2018
  • ACM SIGSOFT Software Engineering Notes
  • Quoc-Sang Phan
  • Book Chapter
  • Citations133

Limiting the Number of Trees in Random Forests

  • Jan 01, 2001
  • Patrice Latinne +2
  • Conference Article
  • Citations1

Computational Graph Theoretical Model of the Zebrafish Sensorimotor Pathway

  • Jan 01, 2011
  • AIP conference proceedings
  • Joshua M Peterson +6
  • Research Article
  • Citations77

Exploiting special structure in semidefinite programming: A survey of theory and applications

  • Feb 01, 2010
  • European Journal of Operational Research
  • Etienne De Klerk
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.