Abstract The Convention on Registration of Objects Launched into Outer Space is a United Nations treaty that serves as a means of identifying which States bear international responsibility and liability for space objects. It is an important mechanism of international coordination, forming part of the existing international legal framework that governs outer space activities. This study establishes the capability of using a graph database to quantitatively analyse overall adherence by member States to the Registration Convention. We further investigate the timeliness of adherence by quantifying the delay between the date of launch and registration. It is found that overall adherence to the registration convention has declined over time, with the percentage of adherence fluctuating between 70% and 90% in the past decade. The median registration delay varies for different States, ranging from 83 to 342 days for countries with greater than 100 registered satellites. The graph database connects multiple data types from a variety of public sources, enabling further analysis of factors influencing space object registration, including satellite type and orbit regime. This approach generates insights that may prove useful in expanding our understanding of registration practices, and could be implemented as a method of monitoring progress toward “completeness” of the international space object register.
Highlights The first quantitative analysis of space object registration using a graph database. Overall adherence to the Registration Convention has declined. Adherence is similar for large and small satellites. Adherence is similar across different orbit regimes. Delays of 1–2 years between launch and registration are common.
Representing and querying space object registration data using graph databases
Acta Astronautica ; 173 ; 392-403
2020-04-24
12 pages
Article (Journal)
Electronic Resource
English
Visual Browsing, Querying, and Analyzing of Engineering Databases
British Library Online Contents | 1990
|Querying for Different Similar Images using Maximum Independent Sets of a Graph
British Library Conference Proceedings | 2003
|