IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v39y1988i1p2-7.html
   My bibliography  Save this article

Repetitive bibliographical information in relational databases

Author

Listed:
  • Terrence A. Brooks

Abstract

Bibliographical databases frequently have a few long, repetitive strings such as the recurring names of voluminous authors. Potter [Library Trends. 30(1): 21–39; 1981] observed this characteristic of bibliographical databases in his sample from the University of Illinois library catalog. This article presents a solution to the problem of loading repetitive bibliographical information in a microcomputer‐based relational database‐management system. Normalization theory does not explicitly address the characteristics of bibliographical relational databases. The representational redundancy design saves space in relational database tables by removing long, frequently occurring strings to separate tables where they can be referenced by shorter surrogates in a main table. This design was suggested by some reflections by Kent (Data and Reality, Basic Assumptions in Data Processing Reconsidered. Amsterdam: North‐Holland; 1978) and by the example of MERLIN [Program. 10(4): 123–134; 1976]. Telephone‐book data and the library‐catalog data of Potter was used to illustrate the economies achieved in representing repetitive bibliographical information in relational databases. © 1988 John Wiley & Sons, Inc.

Suggested Citation

  • Terrence A. Brooks, 1988. "Repetitive bibliographical information in relational databases," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 39(1), pages 2-7, January.
    • Handle: RePEc:bla:jamest:v:39:y:1988:i:1:p:2-7
    DOI: 10.1002/(SICI)1097-4571(198801)39:13.0.CO;2-G
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(198801)39:13.0.CO;2-G
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1097-4571(198801)39:13.0.CO;2-G?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:39:y:1988:i:1:p:2-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.