Developing a Scalable SQL-Based Framework for Ingesting and Analyzing Aerospace Simulation Output Data
DOI:
https://doi.org/10.64137/31079458/IJCSEI-V2I3P101Keywords:
Relational Database, Aerospace Data, Data Ingestion, Data Reduction, Simulated Flight Cas, Structural Load, Flight Conditions, External LoadsAbstract
Typical aircraft external loads processes were originally developed for smaller models under legacy computational constraints. While these processes have been adapted to handle modern model sizes, they were not designed to scale efficiently with the growing volume and complexity of simulation data. As a result, downstream plotting and critical case selection workflows remain inefficient and lack consistent traceability across aircraft and analysis loops. To address these limitations, a relational SQL-based framework was developed to structure and scale external loads data across millions of records and multiple analysis types into a unified and structured dataset. This framework enables automated post-processing tools for envelope visualization and comparison, along with a reduction methodology that identifies the smallest subset of critical cases required to preserve structural design conditions within a specified tolerance. The database supports efficient extraction of one-dimensional envelope extrema and optional two-dimensional envelope boundaries using convex hull methods. These envelope requirements are used to define a constraint set, which is solved using a greedy set-cover algorithm with a user-defined tolerance (e.g., 3%) to determine the minimal set of representative conditions. SQL enables efficient filtering, aggregation, and envelope extraction over large datasets, while higher-order geometric and combinatorial operations are performed in Python after data reduction. Application of the framework to a representative dataset containing 4,914 flight conditions produced approximately 696 one-dimensional envelope requirements, which were further reduced to a final subset of 82–94 critical cases depending on the inclusion of multidimensional constraints. The reduction process maintained envelope fidelity within the specified tolerance and completed within practical computational time. This approach consolidates large-scale external loads data into a single, structured, and traceable system and enables repeatable, automated workflows for plotting and case reduction. The resulting process significantly reduces manual engineering effort while maintaining alignment with established analysis practices, providing a scalable and reproducible solution for managing large external loads datasets.
References
[1] Emre Ünay et al., “Tool Development for Aircraft Loads Post-Processing,” Proceedings of the 28th International Congress of the Aeronautical Sciences, pp. 1-6, 2012.
[2] R. Nazzeri, M. Haupt, F. Lange, and C. Sebastien, "Selection of critical load cases using an artificial neural network approach for reserve factor estimation,” Proceedings of the Deutscher Luft- und Raumfahrtkongress pp. 1-10, 2015.
[3] E. F. Codd, “A relational model of data for large shared data banks,” Communications of the ACM, vol. 13, no. 6, pp. 377–387, June 1970, doi: 10.1145/362384.362685.
[4] J. M. Hellerstein, M. Stonebraker, and J. Hamilton, “Architecture of a Database System,” Foundations and Trends® in Databases, vol. 1, no. 2, pp. 141–259, 2007, doi: 10.1561/1900000002.
[5] Y. Babuji et al., “Parsl,” Proceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing, June 2019, doi: 10.1145/3307681.3325400.
[6] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233–235, Aug. 1979, doi: 10.1287/moor.4.3.233.
[7] U. Feige, “A threshold of ln n for approximating set cover,” Journal of the ACM, vol. 45, no. 4, pp. 634–652, July 1998, doi: 10.1145/285055.285059.
[8] P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, “Geometric approximation via coresets,” J. E. Goodman & J. O’Rourke (Eds.), Combinatorial and computational geometry, Cambridge University Press, vol. 52, pp. 1-30, 2004.
[9] C. B. Barber, D. P. Dobkin, and H.Huhdanpaa, “The quickhull algorithm for convex hulls,” ACM Transactions on Mathematical Software, vol. 22, no. 4, pp. 469–483, Dec. 1996, doi: 10.1145/235815.235821.
[10] S. Saha Bagui and R. Walsh Earp, Database Design Using Entity-Relationship Diagrams. CRC Press, 2022.


