Data structures for music encoding: tables, trees, and graphs

被引:0
|
作者
Stutter, Joshua [1 ]
机构
[1] Univ Sheffield, Digital Humanities Inst, Sheffield S10 2TN, England
关键词
Encoding; hierarchy; representation; domain; ontology; structure; REPRESENTATION;
D O I
10.1080/09298215.2024.2412598
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
One of the challenges in planning a digital edition is the selection of the encoding system and representation format that the edition will use to encode musical information. This decision affects the form of the edition not only through the descriptive capabilities of the encoding format, but also through the format's adherence to certain data structures such as tables, trees, and graphs. Far from being straightforward containers, each of these structures possess unique qualities that constrain the encoding process into considering the music within the parameters of that data model. Data that does not fit must be cajoled into the chosen model, with varying degrees of success. Recent work has developed arguments for the use of certain formats in specific cases based on features and interoperability, but a thorough review of the suitability and sustainability of the underlying data structures has yet to be conducted.This paper explores the problem of music representation in data structures from the perspective of musical domain. By encoding the same passages of music in multiple hypothetical formats it demonstrates the musical aspects and, particularly, the relationships that the data structures commonly used in music encoding variously excel at, privilege, or struggle with representing. I argue that encoding projects should consider the constraints that the data structures of a format impose on their encoding; whether there are instances that would be unsatisfactorily modelled, the data biases this creates, and therefore whether it would be advisable to extend the representation format to accommodate another data structure.
引用
收藏
页数:14
相关论文
共 50 条
  • [41] The number of spanning trees for Sierpinski graphs and data center networks
    Zhang, Xiaojuan
    Yang, Gang
    He, Changxiang
    Klasing, Ralf
    Mao, Yaping
    INFORMATION AND COMPUTATION, 2024, 300
  • [42] Secure Model for Distributed Data Structures on Distributed Hash Tables
    Al-Aaridhi, Read
    Yueksektepe, Ahmet
    Graffi, Kalman
    2017 IEEE JORDAN CONFERENCE ON APPLIED ELECTRICAL ENGINEERING AND COMPUTING TECHNOLOGIES (AEECT), 2017,
  • [43] Tables, Figures, and Graphs-Oh My How to Best Display Data
    Siedlecki, Sandra L.
    CLINICAL NURSE SPECIALIST, 2023, 37 (04) : 160 - 163
  • [44] Dynamic Data Structures for Document Collections and Graphs
    Munro, J. Ian
    Nekrich, Yakov
    Vitter, Jeffrey Scott
    PODS'15: PROCEEDINGS OF THE 33RD ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2015, : 277 - 289
  • [45] Succinct Data Structures for Families of Interval Graphs
    Acan, Huseyin
    Chakraborty, Sankardeep
    Jo, Seungbum
    Satti, Srinivasa Rao
    ALGORITHMS AND DATA STRUCTURES, WADS 2019, 2019, 11646 : 1 - 13
  • [46] DANCE AND MUSIC IN THE IGUVINE TABLES
    Rocca, Giovanna
    ARISTONOTHOS-SCRITTI PER IL MEDITERRANEO ANTICO, 2018, 14 : 67 - 86
  • [47] PROGRAMS TO PROCESS TREES, REPRESENTING PROGRAM STRUCTURES AND DATA-STRUCTURES
    WILSON, AD
    SOFTWARE-PRACTICE & EXPERIENCE, 1984, 14 (09): : 807 - 816
  • [48] ENCODING PIXEL TREES
    TAMMINEN, M
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 28 (01): : 44 - 57
  • [49] Mutual information and the encoding of contingency tables
    Jerdee, Maximilian
    Kirkley, Alec
    Newman, M. E. J.
    PHYSICAL REVIEW E, 2024, 110 (06)
  • [50] Generating power of atomic grammars on data structures. Encoding of data structures by strings of symbols
    Gostev, Yu.G.
    Cybernetics (English Translation of Kibernetika), 1989, 24 (05):