Institutional Repository

Browsing Quaestiones Informaticae Vol 6 No 2 by Title

Browsing Quaestiones Informaticae Vol 6 No 2 by Title

Sort by: Order: Results:

  • A classification of partitioning rules for information system design 
    Mende, J. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In designing a computer-based information system one can partition the transformation process in many alternative ways. To find the optimal partition, a designer needs explicit rules which predict the most successful ...
  • A data structure for exchanging geographical information 
    Cooper, A.K. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Geographical information consists of non-spatial information (alphanumeric) and spatial information (vector and raster), the relationships between the non-spatial information and the spatial information, as well as ...
  • Modelling distributed database concurrency control overheads 
    Rennhackkamp, M.H.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Numerous concurrency control methods have been proposed for distributed databases. Various crz·teria are used to compare these methods. The comparisons range from qualitative overviews through quantitative analyses to ...
  • On syntax and semantics related to incomplete information databases 
    Orlowska, M.E. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    We propose a mathematical model of a database with incomplete information, which we call the N-system. Basically speaking, such a system stores information concerning properties of some objects. The information may be ...
  • Rekenaar spraaksintese: die omskakeling van teks na klank - 'n prestasiemeting 
    Wagener, M.J.; De Kock, G de V (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Verslag word gelewer oor 'n prestasiemeting van 'n stel letter-na-klank reels vir die omskakeling van Afrikaanse teks na foneme. Die prestasie van die stel reels word getoets deur gebruik te maak van 'n verteenwoordigende ...
  • Traversable trees and forests 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Two topics are studied, related and generalised in this paper - the Knuth transform of an arbitrary tree to a binary tree, and Pfaltz' s definition of a data structure as a graph with assignments. Trees are defined in ...

Search UnisaIR


Browse

My Account